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-fa1c628-m [2019-01-31 17:07:04,787 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 17:07:04,789 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 17:07:04,801 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 17:07:04,801 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 17:07:04,802 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 17:07:04,803 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 17:07:04,805 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 17:07:04,807 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 17:07:04,808 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 17:07:04,809 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 17:07:04,809 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 17:07:04,810 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 17:07:04,811 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 17:07:04,812 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 17:07:04,813 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 17:07:04,814 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 17:07:04,815 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 17:07:04,818 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 17:07:04,821 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 17:07:04,822 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 17:07:04,827 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 17:07:04,832 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 17:07:04,833 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 17:07:04,833 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 17:07:04,836 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 17:07:04,837 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 17:07:04,838 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 17:07:04,841 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 17:07:04,842 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 17:07:04,842 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 17:07:04,843 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 17:07:04,843 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 17:07:04,843 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 17:07:04,844 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 17:07:04,845 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 17:07:04,845 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-31 17:07:04,857 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 17:07:04,858 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 17:07:04,858 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 17:07:04,859 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 17:07:04,859 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 17:07:04,859 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 17:07:04,859 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 17:07:04,859 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 17:07:04,860 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 17:07:04,860 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 17:07:04,860 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 17:07:04,860 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 17:07:04,860 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 17:07:04,861 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 17:07:04,861 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 17:07:04,861 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 17:07:04,862 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 17:07:04,862 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 17:07:04,862 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 17:07:04,862 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 17:07:04,863 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 17:07:04,863 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 17:07:04,863 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 17:07:04,863 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 17:07:04,863 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 17:07:04,863 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 17:07:04,864 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 17:07:04,864 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 17:07:04,864 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 17:07:04,864 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 17:07:04,864 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 17:07:04,865 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:07:04,865 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 17:07:04,865 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 17:07:04,865 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 17:07:04,865 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 17:07:04,866 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 17:07:04,866 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 17:07:04,866 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 17:07:04,866 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 17:07:04,897 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 17:07:04,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 17:07:04,920 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 17:07:04,922 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 17:07:04,923 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 17:07:04,923 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-31 17:07:04,924 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl' [2019-01-31 17:07:04,972 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 17:07:04,974 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 17:07:04,974 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 17:07:04,974 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 17:07:04,975 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 17:07:04,993 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 31.01 05:07:04" (1/1) ... [2019-01-31 17:07:05,005 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 31.01 05:07:04" (1/1) ... [2019-01-31 17:07:05,032 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 17:07:05,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 17:07:05,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 17:07:05,033 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 17:07:05,045 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 31.01 05:07:04" (1/1) ... [2019-01-31 17:07:05,045 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 31.01 05:07:04" (1/1) ... [2019-01-31 17:07:05,047 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 31.01 05:07:04" (1/1) ... [2019-01-31 17:07:05,047 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 31.01 05:07:04" (1/1) ... [2019-01-31 17:07:05,051 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 31.01 05:07:04" (1/1) ... [2019-01-31 17:07:05,055 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 31.01 05:07:04" (1/1) ... [2019-01-31 17:07:05,056 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 31.01 05:07:04" (1/1) ... [2019-01-31 17:07:05,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 17:07:05,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 17:07:05,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 17:07:05,059 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 17:07:05,061 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 31.01 05:07:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:07:05,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 17:07:05,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 17:07:05,489 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 17:07:05,490 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-01-31 17:07:05,491 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:07:05 BoogieIcfgContainer [2019-01-31 17:07:05,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 17:07:05,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 17:07:05,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 17:07:05,505 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 17:07:05,506 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 31.01 05:07:04" (1/2) ... [2019-01-31 17:07:05,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f29d1d6 and model type speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:07:05, skipping insertion in model container [2019-01-31 17:07:05,507 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 31.01 05:07:05" (2/2) ... [2019-01-31 17:07:05,510 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-unlimited.bpl [2019-01-31 17:07:05,523 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 17:07:05,531 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-31 17:07:05,546 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-31 17:07:05,575 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 17:07:05,575 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 17:07:05,575 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 17:07:05,575 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 17:07:05,576 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 17:07:05,576 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 17:07:05,576 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 17:07:05,576 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 17:07:05,594 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-31 17:07:05,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 17:07:05,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:05,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 17:07:05,604 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:05,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:05,610 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-01-31 17:07:05,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:05,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:05,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:05,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:05,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:05,804 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-31 17:07:05,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:07:05,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:07:05,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:07:05,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:07:05,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:07:05,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:07:05,824 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-01-31 17:07:06,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:06,008 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-01-31 17:07:06,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:07:06,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 17:07:06,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:06,025 INFO L225 Difference]: With dead ends: 29 [2019-01-31 17:07:06,025 INFO L226 Difference]: Without dead ends: 24 [2019-01-31 17:07:06,028 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-31 17:07:06,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-31 17:07:06,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-01-31 17:07:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-31 17:07:06,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-01-31 17:07:06,058 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-01-31 17:07:06,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:06,059 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-01-31 17:07:06,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:07:06,060 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-01-31 17:07:06,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:07:06,060 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:06,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:07:06,061 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:06,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:06,062 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-01-31 17:07:06,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:06,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:06,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:06,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:06,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:06,189 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-31 17:07:06,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:06,189 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:06,190 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:07:06,192 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2019-01-31 17:07:06,247 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:06,247 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:06,318 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:06,319 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-31 17:07:06,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:06,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:06,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:06,326 INFO 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-31 17:07:06,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:06,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:06,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:06,548 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-31 17:07:06,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,569 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-31 17:07:06,829 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-31 17:07:06,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:07:06,975 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-01-31 17:07:06,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,992 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-31 17:07:07,144 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-01-31 17:07:07,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,198 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-31 17:07:07,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,261 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,281 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:07:07,395 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-31 17:07:07,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, 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-31 17:07:07,443 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-31 17:07:07,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:07:07,596 INFO L303 Elim1Store]: Index analysis took 135 ms [2019-01-31 17:07:07,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, 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-31 17:07:07,600 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,789 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,830 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,854 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,870 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,885 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,960 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-31 17:07:07,961 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-31 17:07:08,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:07:08,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,093 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-31 17:07:08,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:08,195 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-31 17:07:08,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:08,237 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-31 17:07:08,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:08,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:07:08,259 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:08,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:07:08,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:07:08,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:07:08,261 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2019-01-31 17:07:08,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:08,690 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-01-31 17:07:08,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:07:08,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:07:08,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:08,692 INFO L225 Difference]: With dead ends: 47 [2019-01-31 17:07:08,692 INFO L226 Difference]: Without dead ends: 45 [2019-01-31 17:07:08,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:07:08,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-31 17:07:08,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 18. [2019-01-31 17:07:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-31 17:07:08,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2019-01-31 17:07:08,699 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 3 [2019-01-31 17:07:08,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:08,700 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2019-01-31 17:07:08,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:07:08,700 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2019-01-31 17:07:08,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:07:08,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:08,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:07:08,701 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:08,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:08,701 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-01-31 17:07:08,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:08,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:08,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:08,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:08,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:08,812 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-31 17:07:08,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:08,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:08,813 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:07:08,813 INFO L207 CegarAbsIntRunner]: [0], [6], [27] [2019-01-31 17:07:08,816 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:08,816 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:08,827 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:08,827 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-31 17:07:08,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:08,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:08,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:08,828 INFO 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-31 17:07:08,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:08,840 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:08,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:08,909 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-31 17:07:08,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, 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-31 17:07:08,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,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, 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-31 17:07:08,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,949 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-31 17:07:08,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,964 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-31 17:07:08,985 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-31 17:07:08,987 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,032 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,056 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,090 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:07:09,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,263 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-31 17:07:09,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:09,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,434 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-31 17:07:09,435 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,456 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,509 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,528 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,565 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-31 17:07:09,566 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:72, output treesize:71 [2019-01-31 17:07:09,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:09,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,660 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-31 17:07:09,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:09,685 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-31 17:07:09,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:09,716 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-31 17:07:09,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:07:09,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-31 17:07:09,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:07:09,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:07:09,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:07:09,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:07:09,739 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2019-01-31 17:07:09,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:09,821 INFO L93 Difference]: Finished difference Result 23 states and 60 transitions. [2019-01-31 17:07:09,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:07:09,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 17:07:09,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:09,823 INFO L225 Difference]: With dead ends: 23 [2019-01-31 17:07:09,823 INFO L226 Difference]: Without dead ends: 22 [2019-01-31 17:07:09,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:07:09,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-31 17:07:09,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-31 17:07:09,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-31 17:07:09,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2019-01-31 17:07:09,831 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 3 [2019-01-31 17:07:09,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:09,831 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 59 transitions. [2019-01-31 17:07:09,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:07:09,831 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 59 transitions. [2019-01-31 17:07:09,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:07:09,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:09,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:07:09,832 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:09,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:09,833 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-01-31 17:07:09,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:09,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:09,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:09,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:09,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:09,936 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-31 17:07:09,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:09,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:09,937 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:07:09,938 INFO L207 CegarAbsIntRunner]: [0], [24], [27] [2019-01-31 17:07:09,940 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:09,940 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:09,947 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:09,947 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-31 17:07:09,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:09,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:09,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:09,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 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-31 17:07:09,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:09,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:09,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:10,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,012 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-31 17:07:10,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,093 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-31 17:07:10,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,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, 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-31 17:07:10,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:07:10,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,370 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-31 17:07:10,371 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,414 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,485 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,633 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-31 17:07:10,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:07:10,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:07:10,665 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-31 17:07:10,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:10,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, 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-31 17:07:10,699 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,832 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,852 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,869 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,014 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,025 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,089 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-31 17:07:11,089 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-01-31 17:07:11,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:07:11,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,164 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-31 17:07:11,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-01-31 17:07:11,182 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-31 17:07:11,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:11,195 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-31 17:07:11,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:11,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:07:11,214 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:11,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:07:11,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:07:11,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:07:11,215 INFO L87 Difference]: Start difference. First operand 21 states and 59 transitions. Second operand 6 states. [2019-01-31 17:07:11,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:11,490 INFO L93 Difference]: Finished difference Result 39 states and 79 transitions. [2019-01-31 17:07:11,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:07:11,491 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:07:11,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:11,493 INFO L225 Difference]: With dead ends: 39 [2019-01-31 17:07:11,493 INFO L226 Difference]: Without dead ends: 36 [2019-01-31 17:07:11,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:07:11,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-31 17:07:11,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2019-01-31 17:07:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-31 17:07:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 67 transitions. [2019-01-31 17:07:11,500 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 67 transitions. Word has length 3 [2019-01-31 17:07:11,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:11,501 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 67 transitions. [2019-01-31 17:07:11,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:07:11,501 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 67 transitions. [2019-01-31 17:07:11,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:07:11,501 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:11,502 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:07:11,502 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:11,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:11,502 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-01-31 17:07:11,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:11,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:11,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:11,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:11,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:11,570 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-31 17:07:11,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:11,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:11,570 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:07:11,571 INFO L207 CegarAbsIntRunner]: [0], [10], [27] [2019-01-31 17:07:11,573 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:11,573 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:11,578 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:11,578 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-31 17:07:11,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:11,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:11,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:11,579 INFO 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-31 17:07:11,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:11,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:11,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:11,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, 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-31 17:07:11,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, 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-31 17:07:11,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,633 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-31 17:07:11,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:07:11,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,663 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-31 17:07:11,784 INFO L303 Elim1Store]: Index analysis took 118 ms [2019-01-31 17:07:11,786 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-31 17:07:11,787 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,935 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,962 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,980 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,995 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,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, 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-31 17:07:12,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:07:12,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:12,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,170 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-31 17:07:12,171 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,188 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,202 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,222 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,259 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-31 17:07:12,260 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-31 17:07:12,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:07:12,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,339 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-31 17:07:12,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:12,357 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-31 17:07:12,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:12,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:12,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:07:12,390 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:12,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:07:12,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:07:12,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:07:12,392 INFO L87 Difference]: Start difference. First operand 23 states and 67 transitions. Second operand 6 states. [2019-01-31 17:07:12,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:12,575 INFO L93 Difference]: Finished difference Result 49 states and 101 transitions. [2019-01-31 17:07:12,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:07:12,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:07:12,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:12,577 INFO L225 Difference]: With dead ends: 49 [2019-01-31 17:07:12,577 INFO L226 Difference]: Without dead ends: 47 [2019-01-31 17:07:12,577 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-31 17:07:12,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-31 17:07:12,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 25. [2019-01-31 17:07:12,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-31 17:07:12,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 80 transitions. [2019-01-31 17:07:12,585 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 80 transitions. Word has length 3 [2019-01-31 17:07:12,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:12,585 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 80 transitions. [2019-01-31 17:07:12,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:07:12,586 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 80 transitions. [2019-01-31 17:07:12,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:12,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:12,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:12,586 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:12,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:12,587 INFO L82 PathProgramCache]: Analyzing trace with hash 941528, now seen corresponding path program 1 times [2019-01-31 17:07:12,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:12,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:12,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:12,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:12,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:12,648 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-31 17:07:12,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:12,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:12,648 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:12,649 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [27] [2019-01-31 17:07:12,651 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:12,651 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:12,657 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:12,657 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-31 17:07:12,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:12,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:12,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:12,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 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-31 17:07:12,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:12,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:12,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:12,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:07:12,713 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-31 17:07:12,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,720 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-31 17:07:12,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:07:12,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,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, 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-31 17:07:12,883 INFO L303 Elim1Store]: Index analysis took 120 ms [2019-01-31 17:07:12,884 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-31 17:07:12,885 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,916 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,951 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,985 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,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 48 treesize of output 54 [2019-01-31 17:07:13,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,067 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-31 17:07:13,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:13,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:13,166 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,184 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,200 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,218 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,252 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-31 17:07:13,253 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:07:13,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:07:13,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,331 INFO L267 ElimStorePlain]: Start 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-31 17:07:13,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:13,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-31 17:07:13,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,417 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-31 17:07:13,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-31 17:07:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:13,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:13,469 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-31 17:07:13,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:13,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:13,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:13,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:13,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:13,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:13,490 INFO L87 Difference]: Start difference. First operand 25 states and 80 transitions. Second operand 8 states. [2019-01-31 17:07:14,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:14,070 INFO L93 Difference]: Finished difference Result 61 states and 138 transitions. [2019-01-31 17:07:14,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:14,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:07:14,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:14,072 INFO L225 Difference]: With dead ends: 61 [2019-01-31 17:07:14,072 INFO L226 Difference]: Without dead ends: 57 [2019-01-31 17:07:14,073 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-31 17:07:14,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-31 17:07:14,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-01-31 17:07:14,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-31 17:07:14,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 98 transitions. [2019-01-31 17:07:14,080 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 98 transitions. Word has length 4 [2019-01-31 17:07:14,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:14,081 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 98 transitions. [2019-01-31 17:07:14,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:14,081 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 98 transitions. [2019-01-31 17:07:14,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:14,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:14,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:14,082 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:14,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:14,082 INFO L82 PathProgramCache]: Analyzing trace with hash 941590, now seen corresponding path program 1 times [2019-01-31 17:07:14,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:14,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:14,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:14,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:14,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:14,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-31 17:07:14,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:14,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:14,230 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:14,230 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [27] [2019-01-31 17:07:14,231 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:14,231 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:14,236 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:14,237 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-31 17:07:14,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:14,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:14,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:14,237 INFO 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-31 17:07:14,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:14,250 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:14,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:14,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,289 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-31 17:07:14,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,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 58 treesize of output 67 [2019-01-31 17:07:14,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,385 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-31 17:07:14,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:07:14,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,511 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-31 17:07:14,512 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,538 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,563 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,590 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:07:14,677 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-31 17:07:14,684 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-31 17:07:14,692 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-31 17:07:14,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:14,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:14,708 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,746 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,767 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,782 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,794 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,805 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,855 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-31 17:07:14,856 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-31 17:07:14,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,994 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-31 17:07:14,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,052 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-31 17:07:15,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-31 17:07:15,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,097 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:15,099 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-31 17:07:15,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,144 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-31 17:07:15,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-31 17:07:15,166 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-31 17:07:15,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:15,191 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-31 17:07:15,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:15,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:15,210 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:15,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:15,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:15,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:15,215 INFO L87 Difference]: Start difference. First operand 29 states and 98 transitions. Second operand 8 states. [2019-01-31 17:07:15,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:15,778 INFO L93 Difference]: Finished difference Result 59 states and 140 transitions. [2019-01-31 17:07:15,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:15,779 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:07:15,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:15,780 INFO L225 Difference]: With dead ends: 59 [2019-01-31 17:07:15,780 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 17:07:15,781 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-31 17:07:15,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 17:07:15,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-01-31 17:07:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-31 17:07:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 110 transitions. [2019-01-31 17:07:15,790 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 110 transitions. Word has length 4 [2019-01-31 17:07:15,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:15,790 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 110 transitions. [2019-01-31 17:07:15,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:15,790 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 110 transitions. [2019-01-31 17:07:15,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:15,791 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:15,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:15,791 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:15,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:15,792 INFO L82 PathProgramCache]: Analyzing trace with hash 941156, now seen corresponding path program 1 times [2019-01-31 17:07:15,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:15,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:15,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:15,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:15,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:15,886 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-31 17:07:15,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:15,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:15,887 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:15,887 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [27] [2019-01-31 17:07:15,889 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:15,889 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:15,893 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:15,894 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-31 17:07:15,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:15,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:15,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:15,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 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-31 17:07:15,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:15,905 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:15,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:15,930 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-31 17:07:15,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:07:15,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,942 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-31 17:07:15,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,954 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-31 17:07:15,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,969 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-31 17:07:15,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:15,983 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,010 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,032 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,049 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,064 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,107 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-31 17:07:16,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,153 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-31 17:07:16,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,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, 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-31 17:07:16,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,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-31 17:07:16,272 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,287 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,304 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,319 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,353 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-31 17:07:16,353 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:07:16,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:07:16,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,422 INFO L267 ElimStorePlain]: Start 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-31 17:07:16,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:16,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,445 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:16,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:16,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:16,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:42 [2019-01-31 17:07:16,499 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-31 17:07:16,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:16,557 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-31 17:07:16,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:16,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:16,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:16,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:16,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:16,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:16,577 INFO L87 Difference]: Start difference. First operand 30 states and 110 transitions. Second operand 8 states. [2019-01-31 17:07:16,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:16,973 INFO L93 Difference]: Finished difference Result 57 states and 144 transitions. [2019-01-31 17:07:16,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:16,974 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:07:16,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:16,975 INFO L225 Difference]: With dead ends: 57 [2019-01-31 17:07:16,975 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 17:07:16,976 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-31 17:07:16,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 17:07:16,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-01-31 17:07:16,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-31 17:07:16,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2019-01-31 17:07:16,985 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 109 transitions. Word has length 4 [2019-01-31 17:07:16,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:16,986 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 109 transitions. [2019-01-31 17:07:16,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:16,986 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 109 transitions. [2019-01-31 17:07:16,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:16,987 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:16,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:16,987 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:16,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:16,987 INFO L82 PathProgramCache]: Analyzing trace with hash 941280, now seen corresponding path program 1 times [2019-01-31 17:07:16,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:16,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:16,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:16,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:16,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:17,088 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-31 17:07:17,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:17,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:17,089 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:17,089 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [27] [2019-01-31 17:07:17,090 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:17,091 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:17,095 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:17,095 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-31 17:07:17,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:17,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:17,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:17,096 INFO 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-31 17:07:17,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:17,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:17,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:17,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,142 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-31 17:07:17,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,181 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-31 17:07:17,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,222 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-31 17:07:17,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,280 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-31 17:07:17,281 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,313 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,398 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-31 17:07:17,401 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-31 17:07:17,405 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-31 17:07:17,418 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-31 17:07:17,422 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-31 17:07:17,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:17,430 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,804 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,856 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,872 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,885 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,896 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,928 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-31 17:07:17,928 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:07:17,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:07:17,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,003 INFO L267 ElimStorePlain]: Start 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-31 17:07:18,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:18,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:18,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,075 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-31 17:07:18,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-31 17:07:18,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-31 17:07:18,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:18,116 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-31 17:07:18,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:18,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:18,135 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:18,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:18,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:18,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:18,136 INFO L87 Difference]: Start difference. First operand 30 states and 109 transitions. Second operand 8 states. [2019-01-31 17:07:18,320 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-01-31 17:07:18,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:18,754 INFO L93 Difference]: Finished difference Result 57 states and 158 transitions. [2019-01-31 17:07:18,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:18,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:07:18,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:18,756 INFO L225 Difference]: With dead ends: 57 [2019-01-31 17:07:18,756 INFO L226 Difference]: Without dead ends: 53 [2019-01-31 17:07:18,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:18,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-31 17:07:18,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-01-31 17:07:18,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-31 17:07:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2019-01-31 17:07:18,766 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 126 transitions. Word has length 4 [2019-01-31 17:07:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:18,766 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 126 transitions. [2019-01-31 17:07:18,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:18,766 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 126 transitions. [2019-01-31 17:07:18,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:18,767 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:18,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:18,767 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:18,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:18,768 INFO L82 PathProgramCache]: Analyzing trace with hash 929872, now seen corresponding path program 1 times [2019-01-31 17:07:18,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:18,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:18,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:18,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:18,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:18,849 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-31 17:07:18,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:18,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:18,850 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:18,850 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [27] [2019-01-31 17:07:18,853 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:18,853 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:18,858 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:18,858 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-31 17:07:18,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:18,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:18,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:18,859 INFO 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-31 17:07:18,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:18,872 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:18,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:18,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,905 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-31 17:07:18,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:07:18,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,985 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-31 17:07:19,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,032 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-31 17:07:19,033 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,049 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,063 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:07:19,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, 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-31 17:07:19,127 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-31 17:07:19,143 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-31 17:07:19,160 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-31 17:07:19,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:19,187 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,211 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,231 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,246 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,259 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,271 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,303 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-31 17:07:19,303 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-31 17:07:19,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:07:19,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,368 INFO L267 ElimStorePlain]: Start 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-31 17:07:19,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:19,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-31 17:07:19,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,428 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-31 17:07:19,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-31 17:07:19,453 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-31 17:07:19,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:19,473 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-31 17:07:19,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:19,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:07:19,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:19,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:19,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:19,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:07:19,493 INFO L87 Difference]: Start difference. First operand 31 states and 126 transitions. Second operand 8 states. [2019-01-31 17:07:19,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:19,908 INFO L93 Difference]: Finished difference Result 73 states and 228 transitions. [2019-01-31 17:07:19,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:19,909 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:07:19,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:19,909 INFO L225 Difference]: With dead ends: 73 [2019-01-31 17:07:19,909 INFO L226 Difference]: Without dead ends: 71 [2019-01-31 17:07:19,910 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-31 17:07:19,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-31 17:07:19,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 40. [2019-01-31 17:07:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-31 17:07:19,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 173 transitions. [2019-01-31 17:07:19,921 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 173 transitions. Word has length 4 [2019-01-31 17:07:19,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:19,922 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 173 transitions. [2019-01-31 17:07:19,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:19,922 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 173 transitions. [2019-01-31 17:07:19,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:19,923 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:19,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:19,923 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:19,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:19,923 INFO L82 PathProgramCache]: Analyzing trace with hash 930184, now seen corresponding path program 1 times [2019-01-31 17:07:19,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:19,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:19,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:19,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:19,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:19,975 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-31 17:07:19,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:19,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:19,975 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:19,976 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [29] [2019-01-31 17:07:19,978 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:19,978 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:19,985 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:19,986 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-31 17:07:19,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:19,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:19,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:19,986 INFO 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-31 17:07:19,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:19,998 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:20,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:20,026 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-31 17:07:20,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, 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-31 17:07:20,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:07:20,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:07:20,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,071 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-31 17:07:20,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-31 17:07:20,086 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,115 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,136 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,153 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,168 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:07:20,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,240 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-31 17:07:20,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,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, 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-31 17:07:20,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,326 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-31 17:07:20,327 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,341 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,356 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,371 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,404 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-31 17:07:20,404 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-31 17:07:20,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:07:20,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,521 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-31 17:07:20,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:20,535 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-31 17:07:20,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:20,556 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-31 17:07:20,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:20,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:07:20,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:20,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:07:20,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:07:20,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:07:20,577 INFO L87 Difference]: Start difference. First operand 40 states and 173 transitions. Second operand 6 states. [2019-01-31 17:07:20,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:20,814 INFO L93 Difference]: Finished difference Result 56 states and 192 transitions. [2019-01-31 17:07:20,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:07:20,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 17:07:20,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:20,816 INFO L225 Difference]: With dead ends: 56 [2019-01-31 17:07:20,816 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 17:07:20,816 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-31 17:07:20,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 17:07:20,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-01-31 17:07:20,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-31 17:07:20,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 180 transitions. [2019-01-31 17:07:20,826 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 180 transitions. Word has length 4 [2019-01-31 17:07:20,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:20,827 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 180 transitions. [2019-01-31 17:07:20,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:07:20,827 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 180 transitions. [2019-01-31 17:07:20,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:20,827 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:20,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:20,828 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:20,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:20,828 INFO L82 PathProgramCache]: Analyzing trace with hash 945434, now seen corresponding path program 1 times [2019-01-31 17:07:20,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:20,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:20,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:20,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:20,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:20,930 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-31 17:07:20,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:20,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:20,931 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:20,931 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [27] [2019-01-31 17:07:20,932 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:20,932 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:20,936 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:20,936 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-31 17:07:20,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:20,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:20,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:20,937 INFO 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-31 17:07:20,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:20,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:20,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:20,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:07:21,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,024 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-31 17:07:21,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:07:21,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:21,849 WARN L181 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-01-31 17:07:21,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,864 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-31 17:07:21,864 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,909 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,940 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,974 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:07:22,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:07: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, 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-31 17:07:22,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:07:22,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:22,091 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-31 17:07:22,093 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,157 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,184 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,201 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,215 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,230 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,284 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-31 17:07:22,285 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-31 17:07:22,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,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, 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-31 17:07:22,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,380 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-31 17:07:22,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-31 17:07:22,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,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, 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-31 17:07:22,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,497 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-31 17:07:22,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-01-31 17:07:22,524 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-31 17:07:22,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:22,544 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-31 17:07:22,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:22,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:07:22,562 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:22,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:22,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:22,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:07:22,563 INFO L87 Difference]: Start difference. First operand 42 states and 180 transitions. Second operand 8 states. [2019-01-31 17:07:23,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:23,053 INFO L93 Difference]: Finished difference Result 96 states and 313 transitions. [2019-01-31 17:07:23,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:23,054 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:07:23,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:23,055 INFO L225 Difference]: With dead ends: 96 [2019-01-31 17:07:23,055 INFO L226 Difference]: Without dead ends: 93 [2019-01-31 17:07:23,056 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-31 17:07:23,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-31 17:07:23,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 55. [2019-01-31 17:07:23,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-31 17:07:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 250 transitions. [2019-01-31 17:07:23,071 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 250 transitions. Word has length 4 [2019-01-31 17:07:23,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:23,071 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 250 transitions. [2019-01-31 17:07:23,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:23,071 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 250 transitions. [2019-01-31 17:07:23,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:23,072 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:23,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:23,073 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:23,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:23,073 INFO L82 PathProgramCache]: Analyzing trace with hash 945000, now seen corresponding path program 1 times [2019-01-31 17:07:23,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:23,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:23,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:23,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:23,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:23,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:23,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:23,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:23,171 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:23,171 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [27] [2019-01-31 17:07:23,173 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:23,173 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:23,178 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:23,178 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-31 17:07:23,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:23,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:23,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:23,179 INFO 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-31 17:07:23,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:23,188 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:23,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:23,222 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-31 17:07:23,240 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-31 17:07:23,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,292 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-31 17:07:23,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,321 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-31 17:07:23,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:23,340 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-31 17:07:23,341 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,368 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,389 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,420 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,459 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-31 17:07:23,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,514 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-31 17:07:23,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,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, 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-31 17:07:23,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,602 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-31 17:07:23,603 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,619 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,634 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,650 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,683 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-31 17:07:23,683 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:07:23,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:07:23,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,754 INFO L267 ElimStorePlain]: Start 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-31 17:07:23,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:23,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-31 17:07:23,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:23,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-31 17:07:23,840 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-31 17:07:23,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:23,862 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-31 17:07:23,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:23,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:23,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:23,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:23,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:23,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:23,884 INFO L87 Difference]: Start difference. First operand 55 states and 250 transitions. Second operand 8 states. [2019-01-31 17:07:24,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:24,352 INFO L93 Difference]: Finished difference Result 84 states and 299 transitions. [2019-01-31 17:07:24,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:24,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:07:24,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:24,354 INFO L225 Difference]: With dead ends: 84 [2019-01-31 17:07:24,354 INFO L226 Difference]: Without dead ends: 82 [2019-01-31 17:07:24,355 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-31 17:07:24,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-31 17:07:24,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-01-31 17:07:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-31 17:07:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 270 transitions. [2019-01-31 17:07:24,374 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 270 transitions. Word has length 4 [2019-01-31 17:07:24,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:24,374 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 270 transitions. [2019-01-31 17:07:24,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:24,374 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 270 transitions. [2019-01-31 17:07:24,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:24,375 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:24,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:24,375 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:24,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:24,376 INFO L82 PathProgramCache]: Analyzing trace with hash 946922, now seen corresponding path program 1 times [2019-01-31 17:07:24,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:24,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:24,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:24,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:24,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:24,476 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-31 17:07:24,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:24,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:24,476 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:24,477 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [27] [2019-01-31 17:07:24,478 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:24,478 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:24,482 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:24,482 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-31 17:07:24,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:24,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:24,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:24,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 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-31 17:07:24,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:24,500 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:24,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:24,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:07:24,535 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-31 17:07:24,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:07:24,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:07:24,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:07:24,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:07:24,624 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,663 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,683 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,715 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,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, 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-31 17:07:24,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,801 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-31 17:07:24,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,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 46 treesize of output 72 [2019-01-31 17:07:24,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:07:24,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,972 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-31 17:07:24,973 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,998 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,022 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,047 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,073 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,117 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-31 17:07:25,117 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-31 17:07:25,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,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, 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-31 17:07:25,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,225 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-31 17:07:25,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-31 17:07:25,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,289 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:25,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, 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-31 17:07:25,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,337 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-31 17:07:25,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-31 17:07:25,397 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-31 17:07:25,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:25,419 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-31 17:07:25,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:25,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:25,438 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:25,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:25,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:25,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:25,439 INFO L87 Difference]: Start difference. First operand 58 states and 270 transitions. Second operand 8 states. [2019-01-31 17:07:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:26,214 INFO L93 Difference]: Finished difference Result 91 states and 313 transitions. [2019-01-31 17:07:26,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:26,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:07:26,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:26,216 INFO L225 Difference]: With dead ends: 91 [2019-01-31 17:07:26,216 INFO L226 Difference]: Without dead ends: 89 [2019-01-31 17:07:26,217 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-31 17:07:26,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-31 17:07:26,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2019-01-31 17:07:26,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-31 17:07:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 277 transitions. [2019-01-31 17:07:26,229 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 277 transitions. Word has length 4 [2019-01-31 17:07:26,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:26,230 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 277 transitions. [2019-01-31 17:07:26,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:26,230 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 277 transitions. [2019-01-31 17:07:26,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:26,231 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:26,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:26,231 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:26,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:26,231 INFO L82 PathProgramCache]: Analyzing trace with hash 934028, now seen corresponding path program 1 times [2019-01-31 17:07:26,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:26,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:26,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:26,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:26,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:26,297 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-31 17:07:26,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:26,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:26,297 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:26,298 INFO L207 CegarAbsIntRunner]: [0], [10], [28], [29] [2019-01-31 17:07:26,298 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:26,298 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:26,302 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:26,302 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-31 17:07:26,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:26,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:26,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:26,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:07:26,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:26,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:26,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:26,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-31 17:07:26,330 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-31 17:07:26,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:07:26,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,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, 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-31 17:07:26,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:07:26,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-31 17:07:26,387 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,412 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,467 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,484 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,498 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-31 17:07:26,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:07:26,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:26,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,630 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-31 17:07:26,630 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,645 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,659 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,678 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,712 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-31 17:07:26,712 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:64, output treesize:67 [2019-01-31 17:07:26,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,747 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-31 17:07:26,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:07:26,852 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-31 17:07:26,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:92 [2019-01-31 17:07:27,111 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 29 [2019-01-31 17:07:27,113 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-31 17:07:27,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:27,117 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-31 17:07:27,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:07:27,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-31 17:07:27,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:07:27,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:07:27,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:07:27,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:07:27,137 INFO L87 Difference]: Start difference. First operand 59 states and 277 transitions. Second operand 4 states. [2019-01-31 17:07:27,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:27,245 INFO L93 Difference]: Finished difference Result 90 states and 454 transitions. [2019-01-31 17:07:27,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:07:27,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 17:07:27,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:27,247 INFO L225 Difference]: With dead ends: 90 [2019-01-31 17:07:27,248 INFO L226 Difference]: Without dead ends: 89 [2019-01-31 17:07:27,248 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-31 17:07:27,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-31 17:07:27,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2019-01-31 17:07:27,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-31 17:07:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 449 transitions. [2019-01-31 17:07:27,265 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 449 transitions. Word has length 4 [2019-01-31 17:07:27,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:27,266 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 449 transitions. [2019-01-31 17:07:27,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:07:27,266 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 449 transitions. [2019-01-31 17:07:27,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:27,267 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:27,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:27,267 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:27,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:27,268 INFO L82 PathProgramCache]: Analyzing trace with hash 933592, now seen corresponding path program 1 times [2019-01-31 17:07:27,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:27,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:27,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:27,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:27,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:27,361 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-31 17:07:27,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:27,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:27,361 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:27,361 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [27] [2019-01-31 17:07:27,362 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:27,362 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:27,367 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:27,368 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-31 17:07:27,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:27,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:27,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:27,368 INFO 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-31 17:07:27,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:27,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:27,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:27,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,415 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-31 17:07:27,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,449 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-31 17:07:27,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:27,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,540 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-31 17:07:27,541 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,561 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,581 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,638 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-31 17:07:27,641 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-31 17:07:27,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:07:27,645 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-31 17:07:27,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:27,670 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-31 17:07:27,670 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,695 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,715 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,732 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,745 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,757 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,788 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-31 17:07:27,789 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:07:27,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:27,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:28,014 INFO L267 ElimStorePlain]: Start 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-31 17:07:28,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:28,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-31 17:07:28,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:28,074 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-31 17:07:28,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-31 17:07:28,092 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-31 17:07:28,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:28,115 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-31 17:07:28,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:28,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:28,135 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:28,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:28,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:28,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:28,136 INFO L87 Difference]: Start difference. First operand 83 states and 449 transitions. Second operand 8 states. [2019-01-31 17:07:28,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:28,526 INFO L93 Difference]: Finished difference Result 121 states and 532 transitions. [2019-01-31 17:07:28,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:28,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:07:28,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:28,529 INFO L225 Difference]: With dead ends: 121 [2019-01-31 17:07:28,529 INFO L226 Difference]: Without dead ends: 119 [2019-01-31 17:07:28,530 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-31 17:07:28,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-31 17:07:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2019-01-31 17:07:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-31 17:07:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-01-31 17:07:28,543 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-01-31 17:07:28,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:28,544 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-01-31 17:07:28,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-01-31 17:07:28,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:28,545 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:28,545 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:28,545 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:28,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:28,545 INFO L82 PathProgramCache]: Analyzing trace with hash 937872, now seen corresponding path program 1 times [2019-01-31 17:07:28,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:28,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:28,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:28,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:28,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:28,741 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-31 17:07:28,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:28,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:28,742 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:28,742 INFO L207 CegarAbsIntRunner]: [0], [14], [28], [29] [2019-01-31 17:07:28,743 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:28,743 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:28,746 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:28,747 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-31 17:07:28,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:28,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:28,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:28,747 INFO 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-31 17:07:28,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:28,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:28,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:28,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-31 17:07:28,843 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-31 17:07:28,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:07:28,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,039 INFO L303 Elim1Store]: Index analysis took 109 ms [2019-01-31 17:07:29,040 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-31 17:07:29,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,165 INFO L303 Elim1Store]: Index analysis took 123 ms [2019-01-31 17:07:29,166 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-31 17:07:29,287 INFO L303 Elim1Store]: Index analysis took 119 ms [2019-01-31 17:07:29,288 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-31 17:07:29,288 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,468 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,488 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,518 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:07:29,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,570 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-31 17:07:29,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,605 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-31 17:07:29,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,661 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-31 17:07:29,661 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,675 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,689 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,704 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:29,734 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-31 17:07:29,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,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 36 treesize of output 68 [2019-01-31 17:07:29,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,789 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-31 17:07:29,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-31 17:07:29,856 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-31 17:07:29,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:29,877 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-31 17:07:29,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:29,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:07:29,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:29,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:07:29,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:07:29,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:07:29,897 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 6 states. [2019-01-31 17:07:30,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:30,156 INFO L93 Difference]: Finished difference Result 110 states and 511 transitions. [2019-01-31 17:07:30,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:07:30,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 17:07:30,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:30,158 INFO L225 Difference]: With dead ends: 110 [2019-01-31 17:07:30,158 INFO L226 Difference]: Without dead ends: 109 [2019-01-31 17:07:30,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:07:30,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-31 17:07:30,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2019-01-31 17:07:30,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-31 17:07:30,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-01-31 17:07:30,170 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-01-31 17:07:30,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:30,170 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-01-31 17:07:30,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:07:30,170 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-01-31 17:07:30,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:30,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:30,171 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-31 17:07:30,171 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:30,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:30,171 INFO L82 PathProgramCache]: Analyzing trace with hash 29182900, now seen corresponding path program 2 times [2019-01-31 17:07:30,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:30,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:30,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:30,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:30,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:30,237 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-31 17:07:30,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:30,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:30,238 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:30,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:30,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:30,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:07:30,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:30,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:30,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:07:30,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:30,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:30,344 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-31 17:07:30,348 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-31 17:07:30,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,352 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-31 17:07:30,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,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, 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-31 17:07:30,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:30,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:30,376 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,416 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,493 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,536 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,549 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,595 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-31 17:07:30,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:07:30,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:30,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:07:30,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,829 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-31 17:07:30,829 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,857 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,893 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,928 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,960 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:31,019 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-31 17:07:31,019 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-01-31 17:07:31,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,044 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-31 17:07:31,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:31,104 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-31 17:07:31,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-31 17:07:31,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,146 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-31 17:07:31,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:31,208 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-31 17:07:31,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:71 [2019-01-31 17:07:31,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,237 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-31 17:07:31,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:31,287 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-31 17:07:31,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-01-31 17:07:31,525 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-31 17:07:31,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:32,036 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-31 17:07:32,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:32,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:07:32,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:32,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:32,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:32,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:32,099 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 10 states. [2019-01-31 17:07:32,956 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-01-31 17:07:33,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:33,585 INFO L93 Difference]: Finished difference Result 133 states and 606 transitions. [2019-01-31 17:07:33,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:33,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:07:33,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:33,588 INFO L225 Difference]: With dead ends: 133 [2019-01-31 17:07:33,588 INFO L226 Difference]: Without dead ends: 128 [2019-01-31 17:07:33,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:33,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-01-31 17:07:33,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2019-01-31 17:07:33,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-31 17:07:33,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 538 transitions. [2019-01-31 17:07:33,604 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 538 transitions. Word has length 5 [2019-01-31 17:07:33,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:33,604 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 538 transitions. [2019-01-31 17:07:33,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 538 transitions. [2019-01-31 17:07:33,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:33,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:33,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:33,605 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:33,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:33,605 INFO L82 PathProgramCache]: Analyzing trace with hash 29172052, now seen corresponding path program 1 times [2019-01-31 17:07:33,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:33,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:33,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:33,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:33,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:33,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:33,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:33,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:33,718 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:33,718 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [29] [2019-01-31 17:07:33,719 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:33,719 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:33,723 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:33,723 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-31 17:07:33,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:33,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:33,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:33,724 INFO 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-31 17:07:33,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:33,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:33,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:33,811 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-31 17:07:33,814 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-31 17:07:33,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,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, 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-31 17:07:33,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,826 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-31 17:07:33,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,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, 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-31 17:07:33,841 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-31 17:07:33,842 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,871 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,894 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,911 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,925 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,967 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-31 17:07:34,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,005 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-31 17:07:34,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,045 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-31 17:07:34,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,096 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-31 17:07:34,097 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,114 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,136 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,152 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,184 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-31 17:07:34,185 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:07:34,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:07:34,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,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-31 17:07:34,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:34,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,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, 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-31 17:07:34,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,310 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-31 17:07:34,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-31 17:07:34,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:34,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:34,382 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-31 17:07:34,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:34,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:34,401 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:34,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:34,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:34,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:34,401 INFO L87 Difference]: Start difference. First operand 95 states and 538 transitions. Second operand 8 states. [2019-01-31 17:07:34,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:34,730 INFO L93 Difference]: Finished difference Result 125 states and 622 transitions. [2019-01-31 17:07:34,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:34,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:07:34,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:34,733 INFO L225 Difference]: With dead ends: 125 [2019-01-31 17:07:34,733 INFO L226 Difference]: Without dead ends: 124 [2019-01-31 17:07:34,733 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-31 17:07:34,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-31 17:07:34,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 102. [2019-01-31 17:07:34,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-31 17:07:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 589 transitions. [2019-01-31 17:07:34,751 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 589 transitions. Word has length 5 [2019-01-31 17:07:34,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:34,751 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 589 transitions. [2019-01-31 17:07:34,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:34,751 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 589 transitions. [2019-01-31 17:07:34,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:34,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:34,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:34,753 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:34,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:34,753 INFO L82 PathProgramCache]: Analyzing trace with hash 29187302, now seen corresponding path program 1 times [2019-01-31 17:07:34,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:34,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:34,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:34,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:34,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:34,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:34,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:34,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:34,926 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:34,927 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [27] [2019-01-31 17:07:34,929 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:34,929 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:34,932 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:34,933 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-31 17:07:34,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:34,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:34,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:34,933 INFO 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-31 17:07:34,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:34,943 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:34,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:34,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,980 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-31 17:07:35,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,017 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-31 17:07:35,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,062 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-31 17:07:35,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:35,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,188 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-31 17:07:35,189 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:35,214 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:35,254 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:35,281 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:35,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:35,344 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-31 17:07:35,347 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-31 17:07:35,350 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-31 17:07:35,354 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-31 17:07:35,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:35,361 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-31 17:07:35,361 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:35,397 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:35,418 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:35,434 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:35,448 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:35,461 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:35,505 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-31 17:07:35,506 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:07:35,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,542 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-31 17:07:35,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:35,606 INFO L267 ElimStorePlain]: Start 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-31 17:07:35,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:07:35,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,645 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-31 17:07:35,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:35,691 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-31 17:07:35,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-31 17:07:35,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,730 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:35,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,732 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-31 17:07:35,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:35,784 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-31 17:07:35,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-31 17:07:35,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-31 17:07:35,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:35,863 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-31 17:07:35,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:35,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:35,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:35,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:35,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:35,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:35,884 INFO L87 Difference]: Start difference. First operand 102 states and 589 transitions. Second operand 10 states. [2019-01-31 17:07:36,021 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-01-31 17:07:37,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:37,511 INFO L93 Difference]: Finished difference Result 149 states and 665 transitions. [2019-01-31 17:07:37,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:37,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:07:37,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:37,513 INFO L225 Difference]: With dead ends: 149 [2019-01-31 17:07:37,513 INFO L226 Difference]: Without dead ends: 145 [2019-01-31 17:07:37,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:37,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-31 17:07:37,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 105. [2019-01-31 17:07:37,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-31 17:07:37,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 605 transitions. [2019-01-31 17:07:37,533 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 605 transitions. Word has length 5 [2019-01-31 17:07:37,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:37,533 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 605 transitions. [2019-01-31 17:07:37,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:37,534 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 605 transitions. [2019-01-31 17:07:37,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:37,534 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:37,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:37,535 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:37,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:37,535 INFO L82 PathProgramCache]: Analyzing trace with hash 29186868, now seen corresponding path program 1 times [2019-01-31 17:07:37,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:37,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:37,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:37,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:37,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:37,690 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-31 17:07:37,935 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-31 17:07:37,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:37,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:37,935 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:37,935 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [27] [2019-01-31 17:07:37,936 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:37,936 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:37,939 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:37,940 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-31 17:07:37,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:37,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:37,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:37,940 INFO 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-31 17:07:37,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:37,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:37,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:37,980 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-31 17:07:37,984 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-31 17:07:37,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:37,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:37,990 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-31 17:07:37,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:37,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:37,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:37,997 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-31 17:07:38,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,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, 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-31 17:07:38,015 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-31 17:07:38,015 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,044 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,065 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,083 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,096 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,137 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-31 17:07:38,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,169 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-31 17:07:38,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:38,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,255 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-31 17:07:38,255 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,270 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,285 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,300 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,333 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-31 17:07:38,333 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-31 17:07:38,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:07:38,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,413 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-31 17:07:38,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:38,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-31 17:07:38,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,473 INFO L267 ElimStorePlain]: Start 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-31 17:07:38,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-31 17:07:38,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,504 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:38,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,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, 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-31 17:07:38,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,539 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-31 17:07:38,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-31 17:07:38,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:38,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:38,597 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-31 17:07:38,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:38,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:38,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:38,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:38,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:38,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:38,618 INFO L87 Difference]: Start difference. First operand 105 states and 605 transitions. Second operand 10 states. [2019-01-31 17:07:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:39,162 INFO L93 Difference]: Finished difference Result 138 states and 662 transitions. [2019-01-31 17:07:39,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:39,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:07:39,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:39,165 INFO L225 Difference]: With dead ends: 138 [2019-01-31 17:07:39,165 INFO L226 Difference]: Without dead ends: 136 [2019-01-31 17:07:39,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:39,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-31 17:07:39,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 104. [2019-01-31 17:07:39,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-31 17:07:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 598 transitions. [2019-01-31 17:07:39,186 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 598 transitions. Word has length 5 [2019-01-31 17:07:39,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:39,187 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 598 transitions. [2019-01-31 17:07:39,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:39,187 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 598 transitions. [2019-01-31 17:07:39,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:39,188 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:39,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:39,188 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:39,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:39,188 INFO L82 PathProgramCache]: Analyzing trace with hash 29188666, now seen corresponding path program 1 times [2019-01-31 17:07:39,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:39,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:39,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:39,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:39,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:39,319 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-01-31 17:07:39,337 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-31 17:07:39,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:39,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:39,337 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:39,338 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [27] [2019-01-31 17:07:39,338 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:39,338 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:39,342 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:39,342 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-31 17:07:39,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:39,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:39,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:39,342 INFO 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-31 17:07:39,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:39,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:39,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:39,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:07:39,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,429 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-31 17:07:39,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:39,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:07:39,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,608 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-31 17:07:39,608 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,634 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,690 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,761 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-31 17:07:39,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:07:39,766 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-31 17:07:39,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:07:39,771 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-31 17:07:39,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, 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-31 17:07:39,792 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,093 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,113 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,128 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,140 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,152 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,195 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-31 17:07:40,196 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-31 17:07:40,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,221 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-31 17:07:40,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,264 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-31 17:07:40,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-31 17:07:40,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,297 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:40,298 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-31 17:07:40,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,342 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-31 17:07:40,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-31 17:07:40,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,374 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-31 17:07:40,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,434 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-31 17:07:40,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-31 17:07:40,451 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-31 17:07:40,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:40,479 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-31 17:07:40,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:40,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:07:40,500 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:40,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:40,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:40,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:40,501 INFO L87 Difference]: Start difference. First operand 104 states and 598 transitions. Second operand 10 states. [2019-01-31 17:07:41,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:41,075 INFO L93 Difference]: Finished difference Result 152 states and 738 transitions. [2019-01-31 17:07:41,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:41,078 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:07:41,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:41,080 INFO L225 Difference]: With dead ends: 152 [2019-01-31 17:07:41,080 INFO L226 Difference]: Without dead ends: 151 [2019-01-31 17:07:41,081 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-31 17:07:41,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-31 17:07:41,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 106. [2019-01-31 17:07:41,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-31 17:07:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 612 transitions. [2019-01-31 17:07:41,102 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 612 transitions. Word has length 5 [2019-01-31 17:07:41,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:41,102 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 612 transitions. [2019-01-31 17:07:41,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:41,102 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 612 transitions. [2019-01-31 17:07:41,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:41,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:41,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:41,103 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:41,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:41,103 INFO L82 PathProgramCache]: Analyzing trace with hash 29188790, now seen corresponding path program 1 times [2019-01-31 17:07:41,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:41,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:41,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:41,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:41,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:41,230 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-31 17:07:41,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:41,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:41,231 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:41,231 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [27] [2019-01-31 17:07:41,232 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:41,232 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:41,236 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:41,236 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-31 17:07:41,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:41,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:41,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:41,237 INFO 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-31 17:07:41,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:41,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:41,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:41,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:07:41,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:07:41,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,463 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-31 17:07:41,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:07:41,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,612 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-31 17:07:41,613 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:41,676 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:41,704 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:41,732 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:41,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:41,804 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-31 17:07:41,807 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-31 17:07:41,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, 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-31 17:07:41,813 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-31 17:07:41,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:07:41,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, 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-31 17:07:41,821 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:41,856 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:41,875 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:41,891 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:41,902 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:41,915 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:41,961 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-31 17:07:41,962 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:07:41,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,997 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-31 17:07:41,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:42,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-31 17:07:42,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:07:42,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,077 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:42,078 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-31 17:07:42,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:42,124 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-31 17:07:42,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-01-31 17:07:42,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,162 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:42,163 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-31 17:07:42,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:42,415 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-31 17:07:42,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:57 [2019-01-31 17:07:43,821 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-31 17:07:43,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:43,860 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-31 17:07:43,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:43,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:43,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:43,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:43,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:43,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:43,881 INFO L87 Difference]: Start difference. First operand 106 states and 612 transitions. Second operand 10 states. [2019-01-31 17:07:44,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:44,637 INFO L93 Difference]: Finished difference Result 141 states and 665 transitions. [2019-01-31 17:07:44,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:44,637 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:07:44,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:44,639 INFO L225 Difference]: With dead ends: 141 [2019-01-31 17:07:44,639 INFO L226 Difference]: Without dead ends: 140 [2019-01-31 17:07:44,640 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-31 17:07:44,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-31 17:07:44,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 107. [2019-01-31 17:07:44,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-31 17:07:44,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 619 transitions. [2019-01-31 17:07:44,661 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 619 transitions. Word has length 5 [2019-01-31 17:07:44,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:44,661 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 619 transitions. [2019-01-31 17:07:44,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:44,661 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 619 transitions. [2019-01-31 17:07:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:44,662 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:44,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:44,662 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:44,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:44,662 INFO L82 PathProgramCache]: Analyzing trace with hash 29175212, now seen corresponding path program 1 times [2019-01-31 17:07:44,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:44,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:44,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:44,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:44,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:44,745 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-31 17:07:44,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:44,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:44,745 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:44,746 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [27] [2019-01-31 17:07:44,747 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:44,747 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:44,750 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:44,750 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-31 17:07:44,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:44,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:44,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:44,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 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-31 17:07:44,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:44,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:44,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:44,787 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-31 17:07:44,790 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-31 17:07:44,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,799 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-31 17:07:44,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:07:44,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,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, 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-31 17:07:44,822 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-31 17:07:44,823 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:44,867 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:44,890 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:44,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:44,920 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:44,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:44,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,959 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-31 17:07:44,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,994 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-31 17:07:45,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:45,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:45,082 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,098 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,112 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,128 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,160 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-31 17:07:45,160 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:07:45,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:07:45,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,220 INFO L267 ElimStorePlain]: Start 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-31 17:07:45,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:45,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,245 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:45,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:45,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,282 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-31 17:07:45,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:42 [2019-01-31 17:07:45,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-31 17:07:45,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,345 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-31 17:07:45,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-31 17:07:45,362 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-31 17:07:45,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:45,388 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-31 17:07:45,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:45,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:07:45,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:45,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:45,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:45,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:45,410 INFO L87 Difference]: Start difference. First operand 107 states and 619 transitions. Second operand 10 states. [2019-01-31 17:07:45,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:45,989 INFO L93 Difference]: Finished difference Result 163 states and 816 transitions. [2019-01-31 17:07:45,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:45,990 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:07:45,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:45,993 INFO L225 Difference]: With dead ends: 163 [2019-01-31 17:07:45,993 INFO L226 Difference]: Without dead ends: 162 [2019-01-31 17:07:45,993 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-31 17:07:45,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-01-31 17:07:46,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 116. [2019-01-31 17:07:46,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-31 17:07:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 682 transitions. [2019-01-31 17:07:46,012 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 682 transitions. Word has length 5 [2019-01-31 17:07:46,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:46,012 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 682 transitions. [2019-01-31 17:07:46,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 682 transitions. [2019-01-31 17:07:46,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:46,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:46,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:46,014 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:46,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:46,014 INFO L82 PathProgramCache]: Analyzing trace with hash 29179614, now seen corresponding path program 1 times [2019-01-31 17:07:46,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:46,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:46,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:46,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:46,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:46,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:46,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:46,081 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:46,082 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [27] [2019-01-31 17:07:46,082 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:46,083 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:46,086 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:46,086 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-31 17:07:46,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:46,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:46,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:46,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 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-31 17:07:46,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:46,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:46,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:46,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,134 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-31 17:07:46,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,173 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-31 17:07:46,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:46,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:07:46,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,422 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-31 17:07:46,423 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:46,459 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:46,490 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:46,522 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:46,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:46,597 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-31 17:07:46,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:07:46,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:07:46,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:07:46,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:46,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:46,617 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:46,651 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:46,671 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:46,688 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:46,701 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:46,712 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:46,757 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-31 17:07:46,758 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:07:46,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,803 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-31 17:07:46,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:46,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-31 17:07:46,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:07:46,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,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 43 treesize of output 113 [2019-01-31 17:07:46,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:46,934 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-31 17:07:46,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-31 17:07:46,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,972 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:46,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,974 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-31 17:07:46,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:47,027 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-31 17:07:47,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-31 17:07:47,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:47,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:47,088 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-31 17:07:47,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:47,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:47,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:47,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:47,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:47,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:47,108 INFO L87 Difference]: Start difference. First operand 116 states and 682 transitions. Second operand 10 states. [2019-01-31 17:07:47,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:47,774 INFO L93 Difference]: Finished difference Result 163 states and 796 transitions. [2019-01-31 17:07:47,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:47,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:07:47,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:47,776 INFO L225 Difference]: With dead ends: 163 [2019-01-31 17:07:47,776 INFO L226 Difference]: Without dead ends: 160 [2019-01-31 17:07:47,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:47,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-31 17:07:47,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 122. [2019-01-31 17:07:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-31 17:07:47,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 724 transitions. [2019-01-31 17:07:47,798 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 724 transitions. Word has length 5 [2019-01-31 17:07:47,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:47,798 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 724 transitions. [2019-01-31 17:07:47,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:47,799 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 724 transitions. [2019-01-31 17:07:47,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:47,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:47,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:47,800 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:47,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:47,800 INFO L82 PathProgramCache]: Analyzing trace with hash 29179180, now seen corresponding path program 1 times [2019-01-31 17:07:47,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:47,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:47,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:47,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:47,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:47,930 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-31 17:07:47,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:47,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:47,930 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:47,930 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [27] [2019-01-31 17:07:47,931 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:47,931 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:47,934 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:47,934 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-31 17:07:47,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:47,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:47,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:47,935 INFO 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-31 17:07:47,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:47,944 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:47,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:47,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,970 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-31 17:07:48,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,003 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-31 17:07:48,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,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 32 treesize of output 61 [2019-01-31 17:07:48,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,092 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-31 17:07:48,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,110 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,126 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:07:48,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:07:48,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:07:48,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, 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-31 17:07:48,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:07:48,184 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-31 17:07:48,185 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,209 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,229 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,244 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,257 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,269 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,303 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-31 17:07:48,303 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-31 17:07:48,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:07:48,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,436 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-31 17:07:48,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:48,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-31 17:07:48,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,504 INFO L267 ElimStorePlain]: Start 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-31 17:07:48,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-31 17:07:48,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,575 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:48,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-31 17:07:48,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,616 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-31 17:07:48,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-31 17:07:48,636 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-31 17:07:48,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:48,671 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-31 17:07:48,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:48,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:48,690 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:48,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:48,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:48,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:48,691 INFO L87 Difference]: Start difference. First operand 122 states and 724 transitions. Second operand 10 states. [2019-01-31 17:07:49,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:49,213 INFO L93 Difference]: Finished difference Result 165 states and 829 transitions. [2019-01-31 17:07:49,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:49,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:07:49,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:49,217 INFO L225 Difference]: With dead ends: 165 [2019-01-31 17:07:49,217 INFO L226 Difference]: Without dead ends: 163 [2019-01-31 17:07:49,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:49,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-31 17:07:49,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2019-01-31 17:07:49,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-31 17:07:49,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 745 transitions. [2019-01-31 17:07:49,238 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 745 transitions. Word has length 5 [2019-01-31 17:07:49,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:49,238 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 745 transitions. [2019-01-31 17:07:49,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:49,238 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 745 transitions. [2019-01-31 17:07:49,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:49,239 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:49,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:49,239 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:49,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:49,239 INFO L82 PathProgramCache]: Analyzing trace with hash 28829936, now seen corresponding path program 1 times [2019-01-31 17:07:49,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:49,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:49,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:49,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:49,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:49,382 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-31 17:07:49,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:49,383 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:49,383 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:49,383 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [29] [2019-01-31 17:07:49,384 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:49,384 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:49,387 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:49,387 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-31 17:07:49,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:49,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:49,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:49,388 INFO 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-31 17:07:49,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:49,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:49,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:49,435 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-31 17:07:49,437 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-31 17:07:49,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,446 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-31 17:07:49,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,455 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-31 17:07:49,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:49,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:49,485 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:49,512 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:49,534 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:49,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:49,565 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:49,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:49,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:07:49,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,643 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-31 17:07:49,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,685 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-31 17:07:49,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,733 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-31 17:07:49,734 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:49,749 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:49,765 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:49,781 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:49,815 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-31 17:07:49,816 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:07:50,288 WARN L181 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-31 17:07:50,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:07:50,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:50,322 INFO L267 ElimStorePlain]: Start 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-31 17:07:50,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:07:50,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,347 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:50,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:07:50,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:50,379 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-31 17:07:50,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-31 17:07:50,396 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-31 17:07:50,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:50,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:50,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:50,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-31 17:07:50,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:50,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 17:07:50,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 17:07:50,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:07:50,435 INFO L87 Difference]: Start difference. First operand 125 states and 745 transitions. Second operand 7 states. [2019-01-31 17:07:50,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:50,724 INFO L93 Difference]: Finished difference Result 158 states and 796 transitions. [2019-01-31 17:07:50,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:50,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-31 17:07:50,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:50,727 INFO L225 Difference]: With dead ends: 158 [2019-01-31 17:07:50,727 INFO L226 Difference]: Without dead ends: 156 [2019-01-31 17:07:50,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:07:50,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-31 17:07:50,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2019-01-31 17:07:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-31 17:07:50,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 760 transitions. [2019-01-31 17:07:50,749 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 760 transitions. Word has length 5 [2019-01-31 17:07:50,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:50,749 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 760 transitions. [2019-01-31 17:07:50,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 17:07:50,749 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 760 transitions. [2019-01-31 17:07:50,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:50,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:50,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:50,750 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:50,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:50,751 INFO L82 PathProgramCache]: Analyzing trace with hash 28831546, now seen corresponding path program 2 times [2019-01-31 17:07:50,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:50,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:50,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:50,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:50,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:51,034 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-01-31 17:07:51,055 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-31 17:07:51,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:51,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:51,056 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:51,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:51,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:51,057 INFO 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-31 17:07:51,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:51,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:51,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:07:51,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:51,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:51,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,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 68 treesize of output 71 [2019-01-31 17:07:51,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,151 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-31 17:07:51,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:07:51,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:07:51,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,326 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-31 17:07:51,327 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:51,364 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:51,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:51,436 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:51,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:51,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:07:51,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:07:51,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, 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-31 17:07:51,534 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-31 17:07:51,537 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-31 17:07: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, 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-31 17:07:51,544 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:51,601 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:51,629 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:51,651 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:51,670 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:51,686 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:51,742 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-31 17:07:51,743 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-31 17:07:51,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 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-31 17:07:51,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:51,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:51,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:07:51,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,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 41 treesize of output 111 [2019-01-31 17:07:51,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:51,913 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-31 17:07:51,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-31 17:07:51,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,954 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:51,955 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-31 17:07:51,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:52,008 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-31 17:07:52,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-31 17:07:52,029 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-31 17:07:52,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:52,053 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-31 17:07:52,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:52,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-31 17:07:52,072 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:52,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:52,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:52,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:07:52,073 INFO L87 Difference]: Start difference. First operand 128 states and 760 transitions. Second operand 10 states. [2019-01-31 17:07:52,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:52,790 INFO L93 Difference]: Finished difference Result 241 states and 1191 transitions. [2019-01-31 17:07:52,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:07:52,791 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:07:52,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:52,794 INFO L225 Difference]: With dead ends: 241 [2019-01-31 17:07:52,794 INFO L226 Difference]: Without dead ends: 235 [2019-01-31 17:07:52,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:07:52,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-01-31 17:07:52,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 164. [2019-01-31 17:07:52,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-01-31 17:07:52,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 1007 transitions. [2019-01-31 17:07:52,830 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 1007 transitions. Word has length 5 [2019-01-31 17:07:52,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:52,831 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 1007 transitions. [2019-01-31 17:07:52,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:52,831 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 1007 transitions. [2019-01-31 17:07:52,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:52,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:52,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:52,832 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:52,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:52,833 INFO L82 PathProgramCache]: Analyzing trace with hash 28831858, now seen corresponding path program 1 times [2019-01-31 17:07:52,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:52,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:52,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:52,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:52,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:53,117 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-31 17:07:53,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:53,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:53,117 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:53,117 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [29] [2019-01-31 17:07:53,118 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:53,118 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:53,121 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:53,122 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-31 17:07:53,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:53,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:53,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:53,122 INFO 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-31 17:07:53,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:53,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:53,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:53,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:07:53,165 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-31 17:07:53,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:07:53,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,180 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-31 17:07:53,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:07:53,194 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-31 17:07:53,195 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,222 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,245 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,281 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,295 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,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-31 17:07:53,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,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-31 17:07:53,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:07:53,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,462 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-31 17:07:53,462 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,478 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,493 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,509 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,541 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-31 17:07:53,541 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:07:53,778 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-31 17:07:53,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,909 INFO L303 Elim1Store]: Index analysis took 127 ms [2019-01-31 17:07:53,917 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-31 17:07:53,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:07:54,028 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-31 17:07:54,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:106 [2019-01-31 17:07:54,235 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-31 17:07:54,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,243 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:54,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 72 [2019-01-31 17:07:54,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:54,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,355 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-31 17:07:54,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-01-31 17:07:54,688 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-31 17:07:54,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:126, output treesize:280 [2019-01-31 17:07:54,917 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 90 [2019-01-31 17:07:54,921 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-31 17:07:54,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:54,949 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-31 17:07:54,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:54,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:54,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:54,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:54,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:54,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:54,968 INFO L87 Difference]: Start difference. First operand 164 states and 1007 transitions. Second operand 8 states. [2019-01-31 17:07:55,484 WARN L181 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-31 17:07:55,994 WARN L181 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-01-31 17:07:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:58,776 INFO L93 Difference]: Finished difference Result 208 states and 1150 transitions. [2019-01-31 17:07:58,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:58,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:07:58,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:58,780 INFO L225 Difference]: With dead ends: 208 [2019-01-31 17:07:58,780 INFO L226 Difference]: Without dead ends: 207 [2019-01-31 17:07:58,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:58,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-31 17:07:58,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2019-01-31 17:07:58,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-31 17:07:58,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 1128 transitions. [2019-01-31 17:07:58,812 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 1128 transitions. Word has length 5 [2019-01-31 17:07:58,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:58,812 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 1128 transitions. [2019-01-31 17:07:58,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:58,812 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 1128 transitions. [2019-01-31 17:07:58,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:58,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:58,813 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:58,813 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:58,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:58,814 INFO L82 PathProgramCache]: Analyzing trace with hash 28818278, now seen corresponding path program 1 times [2019-01-31 17:07:58,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:58,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:58,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:58,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:58,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:58,965 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-31 17:07:58,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:58,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:58,966 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:58,966 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [27] [2019-01-31 17:07:58,967 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:58,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:58,970 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:58,970 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-31 17:07:58,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:58,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:58,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:58,971 INFO 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-31 17:07:58,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:58,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:58,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:59,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:07:59,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,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 41 treesize of output 53 [2019-01-31 17:07:59,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:59,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,131 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-31 17:07:59,132 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,146 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,162 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:07:59,204 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-31 17:07:59,207 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-31 17:07:59,210 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-31 17:07:59,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:59,222 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-31 17:07:59,223 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,248 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,268 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,284 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,297 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,308 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,340 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-31 17:07:59,341 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:07:59,557 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-31 17:07:59,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,577 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-31 17:07:59,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:07:59,687 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-31 17:07:59,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-01-31 17:07:59,927 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-31 17:07:59,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,952 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-31 17:07:59,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:08:00,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 89 [2019-01-31 17:08:00,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:00,216 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-31 17:08:00,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:129, output treesize:125 [2019-01-31 17:08:00,435 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-31 17:08:00,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,470 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:00,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, 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-31 17:08:00,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-31 17:08:00,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,804 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:00,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-31 17:08:00,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:00,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:00,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 110 [2019-01-31 17:08:00,966 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:01,129 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-31 17:08:01,129 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:242 [2019-01-31 17:08:01,252 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-31 17:08:01,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:01,288 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-31 17:08:01,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:01,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:08:01,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:01,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:08:01,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:08:01,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:08:01,308 INFO L87 Difference]: Start difference. First operand 181 states and 1128 transitions. Second operand 10 states. [2019-01-31 17:08:02,150 WARN L181 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-01-31 17:08:02,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:02,729 INFO L93 Difference]: Finished difference Result 280 states and 1534 transitions. [2019-01-31 17:08:02,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:08:02,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:08:02,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:02,734 INFO L225 Difference]: With dead ends: 280 [2019-01-31 17:08:02,734 INFO L226 Difference]: Without dead ends: 279 [2019-01-31 17:08:02,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:08:02,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-31 17:08:02,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 185. [2019-01-31 17:08:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-31 17:08:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 1156 transitions. [2019-01-31 17:08:02,774 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 1156 transitions. Word has length 5 [2019-01-31 17:08:02,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:02,774 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 1156 transitions. [2019-01-31 17:08:02,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:08:02,774 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 1156 transitions. [2019-01-31 17:08:02,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:08:02,775 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:02,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:08:02,775 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:02,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:02,776 INFO L82 PathProgramCache]: Analyzing trace with hash 28835766, now seen corresponding path program 1 times [2019-01-31 17:08:02,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:02,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:02,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:02,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:02,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:02,888 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-31 17:08:02,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:08:02,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 17:08:02,889 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:08:02,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:08:02,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:08:02,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:08:02,890 INFO L87 Difference]: Start difference. First operand 185 states and 1156 transitions. Second operand 4 states. [2019-01-31 17:08:02,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:02,998 INFO L93 Difference]: Finished difference Result 201 states and 1179 transitions. [2019-01-31 17:08:02,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:08:02,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 17:08:02,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:03,002 INFO L225 Difference]: With dead ends: 201 [2019-01-31 17:08:03,002 INFO L226 Difference]: Without dead ends: 198 [2019-01-31 17:08:03,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:08:03,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-31 17:08:03,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2019-01-31 17:08:03,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-31 17:08:03,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 1164 transitions. [2019-01-31 17:08:03,049 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 1164 transitions. Word has length 5 [2019-01-31 17:08:03,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:03,049 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 1164 transitions. [2019-01-31 17:08:03,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:08:03,049 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 1164 transitions. [2019-01-31 17:08:03,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:08:03,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:03,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:08:03,051 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:03,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:03,051 INFO L82 PathProgramCache]: Analyzing trace with hash 28822248, now seen corresponding path program 1 times [2019-01-31 17:08:03,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:03,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:03,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:03,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:03,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:03,143 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-31 17:08:03,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:03,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:03,144 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:08:03,145 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [29] [2019-01-31 17:08:03,146 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:03,146 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:03,148 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:03,148 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-31 17:08:03,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:03,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:03,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:03,149 INFO 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-31 17:08:03,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:03,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:03,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:03,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:08:03,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:08:03,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,266 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-31 17:08:03,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,320 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-31 17:08:03,320 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,343 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,364 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,418 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-31 17:08:03,420 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-31 17:08:03,422 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-31 17:08:03,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:08:03,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:08:03,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:08:03,437 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,463 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,483 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,499 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,512 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,524 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,557 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-31 17:08:03,558 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:08:03,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:08:03,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,629 INFO L267 ElimStorePlain]: Start 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-31 17:08:03,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:08:03,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,658 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:03,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:08:03,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,692 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-31 17:08:03,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-31 17:08:03,711 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-31 17:08:03,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:03,731 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-31 17:08:03,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:03,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:08:03,750 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:03,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:08:03,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:08:03,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:08:03,751 INFO L87 Difference]: Start difference. First operand 187 states and 1164 transitions. Second operand 8 states. [2019-01-31 17:08:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:04,144 INFO L93 Difference]: Finished difference Result 208 states and 1202 transitions. [2019-01-31 17:08:04,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:08:04,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:08:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:04,148 INFO L225 Difference]: With dead ends: 208 [2019-01-31 17:08:04,148 INFO L226 Difference]: Without dead ends: 207 [2019-01-31 17:08:04,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:08:04,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-31 17:08:04,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-01-31 17:08:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-31 17:08:04,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 1178 transitions. [2019-01-31 17:08:04,193 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 1178 transitions. Word has length 5 [2019-01-31 17:08:04,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:04,193 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 1178 transitions. [2019-01-31 17:08:04,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:08:04,193 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 1178 transitions. [2019-01-31 17:08:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:08:04,194 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:04,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:08:04,195 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:04,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:04,195 INFO L82 PathProgramCache]: Analyzing trace with hash 29302748, now seen corresponding path program 1 times [2019-01-31 17:08:04,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:04,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:04,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:04,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:04,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:04,355 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-31 17:08:04,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:04,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:04,355 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:08:04,356 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [29] [2019-01-31 17:08:04,358 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:04,358 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:04,360 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:04,360 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-31 17:08:04,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:04,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:04,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:04,362 INFO 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-31 17:08:04,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:04,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:04,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:04,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-31 17:08:04,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,404 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-31 17:08:04,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:08:04,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,508 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-31 17:08:04,508 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,529 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,549 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,601 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-31 17:08:04,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:08:04,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, 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-31 17:08:04,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:08:04,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, 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-31 17:08:04,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, 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-31 17:08:04,684 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,707 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,726 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,741 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,753 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,763 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,795 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-31 17:08:04,795 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-31 17:08:04,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:08:04,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,868 INFO L267 ElimStorePlain]: Start 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-31 17:08:04,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:08:04,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,897 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-31 17:08:04,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,927 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-31 17:08:04,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-01-31 17:08:04,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:04,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:04,970 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-31 17:08:04,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:04,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:08:04,990 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:04,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:08:04,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:08:04,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:08:04,991 INFO L87 Difference]: Start difference. First operand 189 states and 1178 transitions. Second operand 8 states. [2019-01-31 17:08:05,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:05,287 INFO L93 Difference]: Finished difference Result 210 states and 1196 transitions. [2019-01-31 17:08:05,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:08:05,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:08:05,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:05,291 INFO L225 Difference]: With dead ends: 210 [2019-01-31 17:08:05,291 INFO L226 Difference]: Without dead ends: 208 [2019-01-31 17:08:05,291 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-31 17:08:05,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-01-31 17:08:05,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2019-01-31 17:08:05,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-31 17:08:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 1179 transitions. [2019-01-31 17:08:05,321 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 1179 transitions. Word has length 5 [2019-01-31 17:08:05,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:05,321 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 1179 transitions. [2019-01-31 17:08:05,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:08:05,322 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 1179 transitions. [2019-01-31 17:08:05,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:08:05,322 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:05,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:08:05,323 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:05,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:05,323 INFO L82 PathProgramCache]: Analyzing trace with hash 29308202, now seen corresponding path program 2 times [2019-01-31 17:08:05,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:05,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:05,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:05,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:05,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:05,480 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-31 17:08:05,502 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-31 17:08:05,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:05,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:05,503 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:08:05,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:08:05,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:05,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 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-31 17:08:05,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:08:05,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:08:05,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:08:05,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:08:05,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:05,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,546 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-31 17:08:05,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,587 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-31 17:08:05,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,637 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-31 17:08:05,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:08:05,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,771 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-31 17:08:05,772 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:05,803 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:05,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:05,863 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:05,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:05,936 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-31 17:08:05,938 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-31 17:08:05,940 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-31 17:08:05,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-31 17:08:05,946 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-31 17:08:05,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, 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-31 17:08:05,951 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:06,254 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:06,275 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:06,292 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:06,305 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:06,318 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:06,364 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-31 17:08:06,364 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:08:06,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,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, 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-31 17:08:06,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:06,450 INFO L267 ElimStorePlain]: Start 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-31 17:08:06,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:08:06,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,488 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-31 17:08:06,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:06,538 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-31 17:08:06,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-31 17:08:06,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,577 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:06,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 43 treesize of output 124 [2019-01-31 17:08:06,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:06,636 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-31 17:08:06,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-31 17:08:06,660 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-31 17:08:06,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:06,710 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-31 17:08:06,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:06,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:08:06,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:06,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:08:06,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:08:06,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:08:06,730 INFO L87 Difference]: Start difference. First operand 191 states and 1179 transitions. Second operand 10 states. [2019-01-31 17:08:08,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:08,309 INFO L93 Difference]: Finished difference Result 242 states and 1308 transitions. [2019-01-31 17:08:08,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:08:08,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:08:08,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:08,313 INFO L225 Difference]: With dead ends: 242 [2019-01-31 17:08:08,313 INFO L226 Difference]: Without dead ends: 240 [2019-01-31 17:08:08,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:08:08,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-01-31 17:08:08,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 202. [2019-01-31 17:08:08,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-31 17:08:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1251 transitions. [2019-01-31 17:08:08,356 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1251 transitions. Word has length 5 [2019-01-31 17:08:08,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:08,356 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1251 transitions. [2019-01-31 17:08:08,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:08:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1251 transitions. [2019-01-31 17:08:08,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:08:08,357 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:08,357 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:08:08,357 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:08,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:08,358 INFO L82 PathProgramCache]: Analyzing trace with hash 29307954, now seen corresponding path program 1 times [2019-01-31 17:08:08,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:08,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:08,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:08:08,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:08,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:08,467 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-31 17:08:08,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:08,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:08,467 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:08:08,468 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [27] [2019-01-31 17:08:08,469 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:08,469 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:08,471 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:08,471 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-31 17:08:08,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:08,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:08,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:08,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 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-31 17:08:08,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:08,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:08,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:08,509 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-31 17:08:08,512 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-31 17:08:08,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,516 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-31 17:08:08,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:08:08,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,531 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-31 17:08:08,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,540 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-31 17:08:08,540 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,580 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,602 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,619 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,633 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,678 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-31 17:08:08,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,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, 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-31 17:08:08,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,762 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-31 17:08:08,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,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, 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-31 17:08:08,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,887 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-31 17:08:08,888 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,914 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,940 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,996 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:09,020 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:09,065 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-31 17:08:09,066 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:08:09,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,100 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-31 17:08:09,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:09,143 INFO L267 ElimStorePlain]: Start 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-31 17:08:09,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:08:09,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,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 41 treesize of output 111 [2019-01-31 17:08:09,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:09,222 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-31 17:08:09,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-31 17:08:09,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,261 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:09,262 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-31 17:08:09,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:09,316 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-31 17:08:09,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-31 17:08:09,338 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-31 17:08:09,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:09,379 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-31 17:08:09,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:09,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:08:09,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:09,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:08:09,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:08:09,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:08:09,397 INFO L87 Difference]: Start difference. First operand 202 states and 1251 transitions. Second operand 10 states. [2019-01-31 17:08:10,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:10,011 INFO L93 Difference]: Finished difference Result 249 states and 1369 transitions. [2019-01-31 17:08:10,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:08:10,012 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:08:10,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:10,015 INFO L225 Difference]: With dead ends: 249 [2019-01-31 17:08:10,015 INFO L226 Difference]: Without dead ends: 247 [2019-01-31 17:08:10,016 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-31 17:08:10,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-31 17:08:10,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 212. [2019-01-31 17:08:10,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-31 17:08:10,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1326 transitions. [2019-01-31 17:08:10,049 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1326 transitions. Word has length 5 [2019-01-31 17:08:10,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:10,049 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1326 transitions. [2019-01-31 17:08:10,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:08:10,049 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1326 transitions. [2019-01-31 17:08:10,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:08:10,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:10,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:08:10,050 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:10,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:10,050 INFO L82 PathProgramCache]: Analyzing trace with hash 29294624, now seen corresponding path program 1 times [2019-01-31 17:08:10,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:10,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:10,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:10,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:10,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:10,151 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-31 17:08:10,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:10,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:10,152 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:08:10,152 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [27] [2019-01-31 17:08:10,153 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:10,153 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:10,155 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:10,155 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-31 17:08:10,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:10,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:10,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:10,156 INFO 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-31 17:08:10,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:10,165 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:10,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:10,194 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-31 17:08:10,196 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-31 17:08:10,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:08:10,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,209 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-31 17:08:10,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,238 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-31 17:08:10,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:08:10,247 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:10,277 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:10,300 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:10,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:10,334 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:10,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:10,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,376 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-31 17:08:10,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,411 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-31 17:08:10,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,453 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-31 17:08:10,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,510 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-31 17:08:10,511 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:10,525 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:10,540 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:10,557 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:10,590 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-31 17:08:10,591 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-31 17:08:10,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:08:10,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:10,681 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-31 17:08:10,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:08:10,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-31 17:08:10,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:10,748 INFO L267 ElimStorePlain]: Start 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-31 17:08:10,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-31 17:08:10,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,783 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:10,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-31 17:08:10,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:10,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:10,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-31 17:08:10,860 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-31 17:08:10,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:10,900 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-31 17:08:10,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:10,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:08:10,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:10,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:08:10,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:08:10,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:08:10,920 INFO L87 Difference]: Start difference. First operand 212 states and 1326 transitions. Second operand 10 states. [2019-01-31 17:08:11,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:11,505 INFO L93 Difference]: Finished difference Result 260 states and 1437 transitions. [2019-01-31 17:08:11,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:08:11,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:08:11,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:11,509 INFO L225 Difference]: With dead ends: 260 [2019-01-31 17:08:11,509 INFO L226 Difference]: Without dead ends: 258 [2019-01-31 17:08:11,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:08:11,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-31 17:08:11,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 221. [2019-01-31 17:08:11,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-31 17:08:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-01-31 17:08:11,546 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-01-31 17:08:11,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:11,547 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-01-31 17:08:11,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:08:11,547 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-01-31 17:08:11,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:08:11,547 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:11,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:08:11,548 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:11,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:11,548 INFO L82 PathProgramCache]: Analyzing trace with hash 29298904, now seen corresponding path program 1 times [2019-01-31 17:08:11,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:11,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:11,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:11,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:11,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:11,667 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-31 17:08:11,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:11,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:11,668 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:08:11,668 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [28], [29] [2019-01-31 17:08:11,670 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:11,670 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:11,674 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:11,674 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-31 17:08:11,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:11,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:11,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:11,675 INFO 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-31 17:08:11,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:11,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:11,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:11,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-31 17:08:11,725 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-31 17:08:11,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,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, 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-31 17:08:11,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,744 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-31 17:08:11,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,752 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-31 17:08:11,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:08:11,765 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:11,816 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:11,836 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:11,855 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:11,870 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:11,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:11,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 63 treesize of output 56 [2019-01-31 17:08:11,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,945 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-31 17:08:11,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,003 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-31 17:08:12,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-31 17:08:12,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,161 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-31 17:08:12,162 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:12,189 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:12,215 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:12,238 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:12,264 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:12,308 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-31 17:08:12,308 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-31 17:08:12,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,336 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-31 17:08:12,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:12,382 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-31 17:08:12,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-31 17:08:12,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,413 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:12,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 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-31 17:08:12,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:12,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:12,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:55 [2019-01-31 17:08:12,484 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-31 17:08:12,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:12,503 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-31 17:08:12,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:12,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:08:12,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:12,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:08:12,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:08:12,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:08:12,524 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-01-31 17:08:12,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:12,857 INFO L93 Difference]: Finished difference Result 244 states and 1417 transitions. [2019-01-31 17:08:12,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:08:12,857 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:08:12,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:12,860 INFO L225 Difference]: With dead ends: 244 [2019-01-31 17:08:12,861 INFO L226 Difference]: Without dead ends: 243 [2019-01-31 17:08:12,861 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-31 17:08:12,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-31 17:08:12,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 221. [2019-01-31 17:08:12,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-31 17:08:12,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-01-31 17:08:12,899 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-01-31 17:08:12,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:12,899 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-01-31 17:08:12,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:08:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-01-31 17:08:12,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:08:12,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:12,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:08:12,901 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:12,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:12,901 INFO L82 PathProgramCache]: Analyzing trace with hash 29366174, now seen corresponding path program 1 times [2019-01-31 17:08:12,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:12,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:12,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:12,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:12,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:12,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-31 17:08:12,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:12,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:12,956 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:08:12,957 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [28], [29] [2019-01-31 17:08:12,957 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:12,958 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:12,959 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:12,960 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-31 17:08:12,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:12,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:12,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:12,960 INFO 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-31 17:08:12,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:12,969 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:12,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:12,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-31 17:08:12,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-31 17:08:12,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,998 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-31 17:08:13,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,023 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-31 17:08:13,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:08:13,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, 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-31 17:08:13,044 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:13,071 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:13,091 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:13,107 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:13,120 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:13,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:13,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:08:13,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,176 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-31 17:08:13,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:08:13,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,259 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-31 17:08:13,259 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:13,273 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:13,286 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:13,302 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:13,333 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-31 17:08:13,334 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-31 17:08:13,551 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-31 17:08:13,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,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, 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-31 17:08:13,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-01-31 17:08:13,980 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-31 17:08:13,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:349 [2019-01-31 17:08:14,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,096 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 63 [2019-01-31 17:08:14,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:14,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,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, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 92 [2019-01-31 17:08:14,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:14,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,279 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:14,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, 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 72 [2019-01-31 17:08:14,280 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:14,341 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-31 17:08:14,341 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:162, output treesize:126 [2019-01-31 17:08:14,461 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-31 17:08:14,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:14,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:14,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:14,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:08:14,522 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:14,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:08:14,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:08:14,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:08:14,522 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-01-31 17:08:14,958 WARN L181 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-31 17:08:15,323 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-01-31 17:09:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:16,348 INFO L93 Difference]: Finished difference Result 273 states and 1446 transitions. [2019-01-31 17:09:16,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:09:16,349 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:09:16,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:16,352 INFO L225 Difference]: With dead ends: 273 [2019-01-31 17:09:16,353 INFO L226 Difference]: Without dead ends: 272 [2019-01-31 17:09:16,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=79, Invalid=130, Unknown=1, NotChecked=0, Total=210 [2019-01-31 17:09:16,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-01-31 17:09:16,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 222. [2019-01-31 17:09:16,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-31 17:09:16,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 1396 transitions. [2019-01-31 17:09:16,389 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 1396 transitions. Word has length 5 [2019-01-31 17:09:16,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:16,389 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 1396 transitions. [2019-01-31 17:09:16,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:09:16,389 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 1396 transitions. [2019-01-31 17:09:16,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:09:16,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:16,390 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:09:16,390 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:16,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:16,390 INFO L82 PathProgramCache]: Analyzing trace with hash 29353958, now seen corresponding path program 2 times [2019-01-31 17:09:16,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:16,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:16,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:16,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:16,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:16,465 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-31 17:09:16,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:16,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:16,466 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:09:16,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:09:16,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:16,466 INFO 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-31 17:09:16,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:09:16,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:09:16,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:09:16,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:09:16,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:16,505 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-31 17:09:16,509 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-31 17:09:16,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,513 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-31 17:09:16,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,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, 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-31 17:09:16,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,527 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-31 17:09:16,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,536 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-31 17:09:16,537 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:16,578 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:16,600 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:16,618 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:16,632 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:16,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:16,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,679 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-31 17:09:16,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,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 58 treesize of output 67 [2019-01-31 17:09:16,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:09:16,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,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, 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-31 17:09:16,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,912 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-31 17:09:16,913 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:16,939 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:16,965 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:16,992 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:17,016 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:17,063 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-31 17:09:17,063 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-31 17:09:17,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:17,090 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-31 17:09:17,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:17,138 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-31 17:09:17,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-31 17:09:17,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:17,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:17,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:17,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:17,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:17,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:17,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:17,170 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:17,171 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-31 17:09:17,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:17,221 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-31 17:09:17,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-31 17:09:17,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:17,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:17,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:17,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:17,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:17,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:17,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:17,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:17,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:17,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:17,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:17,259 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-31 17:09:17,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:17,307 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-31 17:09:17,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-31 17:09:17,327 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-31 17:09:17,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:17,352 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-31 17:09:17,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:17,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:09:17,372 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:17,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:09:17,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:09:17,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:09:17,373 INFO L87 Difference]: Start difference. First operand 222 states and 1396 transitions. Second operand 10 states. [2019-01-31 17:09:18,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:18,112 INFO L93 Difference]: Finished difference Result 274 states and 1519 transitions. [2019-01-31 17:09:18,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:09:18,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:09:18,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:18,117 INFO L225 Difference]: With dead ends: 274 [2019-01-31 17:09:18,117 INFO L226 Difference]: Without dead ends: 273 [2019-01-31 17:09:18,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:09:18,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-01-31 17:09:18,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 225. [2019-01-31 17:09:18,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-31 17:09:18,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-01-31 17:09:18,159 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-01-31 17:09:18,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:18,159 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-01-31 17:09:18,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:09:18,159 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-01-31 17:09:18,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:09:18,160 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:18,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:09:18,161 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:18,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:18,161 INFO L82 PathProgramCache]: Analyzing trace with hash 29372004, now seen corresponding path program 1 times [2019-01-31 17:09:18,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:18,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:18,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:09:18,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:18,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:18,225 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-31 17:09:18,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:18,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:18,225 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:09:18,226 INFO L207 CegarAbsIntRunner]: [0], [24], [28], [30], [31] [2019-01-31 17:09:18,226 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:18,226 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:18,230 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:18,230 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-31 17:09:18,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:18,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:18,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:18,230 INFO 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-31 17:09:18,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:18,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:18,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:18,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, 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-31 17:09:18,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,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 53 treesize of output 63 [2019-01-31 17:09:18,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:09:18,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09: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, 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-31 17:09:18,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,442 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-31 17:09:18,443 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:18,470 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:18,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:18,521 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:18,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:18,584 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-31 17:09:18,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:09:18,590 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-31 17:09:18,594 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-31 17:09:18,598 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-31 17:09:18,602 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-31 17:09:18,603 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:18,636 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:18,656 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:18,671 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:18,683 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:18,695 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:18,739 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-31 17:09:18,739 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-01-31 17:09:18,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 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-31 17:09:18,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:18,807 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-31 17:09:18,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:97, output treesize:67 [2019-01-31 17:09:18,825 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-31 17:09:18,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:18,835 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-31 17:09:18,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:18,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:09:18,853 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:18,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:09:18,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:09:18,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:09:18,853 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 6 states. [2019-01-31 17:09:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:19,071 INFO L93 Difference]: Finished difference Result 242 states and 1433 transitions. [2019-01-31 17:09:19,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:09:19,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-31 17:09:19,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:19,075 INFO L225 Difference]: With dead ends: 242 [2019-01-31 17:09:19,075 INFO L226 Difference]: Without dead ends: 241 [2019-01-31 17:09:19,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:09:19,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-31 17:09:19,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-01-31 17:09:19,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-31 17:09:19,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-01-31 17:09:19,111 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-01-31 17:09:19,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:19,111 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-01-31 17:09:19,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:09:19,112 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-01-31 17:09:19,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:09:19,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:19,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:09:19,113 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:19,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:19,113 INFO L82 PathProgramCache]: Analyzing trace with hash 29357926, now seen corresponding path program 1 times [2019-01-31 17:09:19,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:19,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:19,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:19,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:19,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:19,214 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-31 17:09:19,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:19,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:19,215 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:09:19,215 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [27] [2019-01-31 17:09:19,216 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:19,216 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:19,219 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:19,219 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-31 17:09:19,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:19,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:19,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:19,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:09:19,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:19,230 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:19,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:19,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,264 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-31 17:09:19,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,304 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-31 17:09:19,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:09:19,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:09:19,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,478 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-31 17:09:19,478 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:19,506 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:19,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:19,558 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:19,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:19,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:09:19,625 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-31 17:09:19,627 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-31 17:09:19,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:09:19,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, 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-31 17:09:19,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, 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-31 17:09:19,637 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:19,672 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:19,693 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:19,709 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:19,723 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:19,733 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:19,779 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-31 17:09:19,780 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:09:19,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,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, 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-31 17:09:19,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:19,859 INFO L267 ElimStorePlain]: Start 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-31 17:09:19,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:09:19,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,895 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-31 17:09:19,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:19,945 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-31 17:09:19,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-31 17:09:19,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,985 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:19,986 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-31 17:09:19,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:20,037 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-31 17:09:20,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-31 17:09:20,057 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-31 17:09:20,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:20,097 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-31 17:09:20,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:20,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:09:20,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:20,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:09:20,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:09:20,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:09:20,116 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 10 states. [2019-01-31 17:09:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:20,765 INFO L93 Difference]: Finished difference Result 276 states and 1527 transitions. [2019-01-31 17:09:20,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:09:20,765 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:09:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:20,769 INFO L225 Difference]: With dead ends: 276 [2019-01-31 17:09:20,769 INFO L226 Difference]: Without dead ends: 274 [2019-01-31 17:09:20,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:09:20,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-31 17:09:20,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 234. [2019-01-31 17:09:20,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-31 17:09:20,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 1480 transitions. [2019-01-31 17:09:20,815 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 1480 transitions. Word has length 5 [2019-01-31 17:09:20,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:20,815 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 1480 transitions. [2019-01-31 17:09:20,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:09:20,815 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 1480 transitions. [2019-01-31 17:09:20,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:09:20,816 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:20,816 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:09:20,816 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:20,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:20,816 INFO L82 PathProgramCache]: Analyzing trace with hash 28933724, now seen corresponding path program 1 times [2019-01-31 17:09:20,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:20,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:20,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:20,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:20,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:20,978 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-31 17:09:20,990 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-31 17:09:20,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:20,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:20,990 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:09:20,991 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [29] [2019-01-31 17:09:20,991 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:20,991 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:20,994 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:20,994 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-31 17:09:20,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:20,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:20,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:20,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:09:21,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:21,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:21,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:21,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,038 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-31 17:09:21,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,072 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-31 17:09:21,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:09:21,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,167 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-31 17:09:21,168 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,186 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,203 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:09:21,249 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-31 17:09:21,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:09:21,254 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-31 17:09:21,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:09:21,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, 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-31 17:09:21,265 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,292 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,312 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,328 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,341 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,352 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,390 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-31 17:09:21,390 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-31 17:09:21,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:09:21,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,454 INFO L267 ElimStorePlain]: Start 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-31 17:09:21,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:09:21,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,650 INFO L303 Elim1Store]: Index analysis took 180 ms [2019-01-31 17:09:21,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-31 17:09:21,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,804 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-31 17:09:21,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-31 17:09:21,820 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-31 17:09:21,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:21,838 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-31 17:09:21,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:21,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:09:21,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:21,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:09:21,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:09:21,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:09:21,859 INFO L87 Difference]: Start difference. First operand 234 states and 1480 transitions. Second operand 8 states. [2019-01-31 17:09:22,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:22,253 INFO L93 Difference]: Finished difference Result 288 states and 1635 transitions. [2019-01-31 17:09:22,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:09:22,254 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:09:22,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:22,258 INFO L225 Difference]: With dead ends: 288 [2019-01-31 17:09:22,258 INFO L226 Difference]: Without dead ends: 287 [2019-01-31 17:09:22,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:09:22,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-01-31 17:09:22,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 250. [2019-01-31 17:09:22,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-01-31 17:09:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 1595 transitions. [2019-01-31 17:09:22,302 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 1595 transitions. Word has length 5 [2019-01-31 17:09:22,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:22,302 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 1595 transitions. [2019-01-31 17:09:22,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:09:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 1595 transitions. [2019-01-31 17:09:22,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:09:22,303 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:22,303 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:09:22,303 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:22,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:22,303 INFO L82 PathProgramCache]: Analyzing trace with hash 28941412, now seen corresponding path program 1 times [2019-01-31 17:09:22,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:22,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:22,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:22,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:22,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:22,396 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-31 17:09:22,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:22,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:22,396 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:09:22,397 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [28], [29] [2019-01-31 17:09:22,398 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:22,398 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:22,400 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:22,400 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-31 17:09:22,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:22,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:22,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:22,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:09:22,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:22,409 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:22,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:22,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-31 17:09:22,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:09:22,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,438 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-31 17:09:22,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,445 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-31 17:09:22,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,453 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-31 17:09:22,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, 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-31 17:09:22,463 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:22,490 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:22,511 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:22,528 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:22,541 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:22,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:22,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-31 17:09:22,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,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-31 17:09:22,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,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-31 17:09:22,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,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-31 17:09:22,678 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:22,693 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:22,708 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:22,724 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:22,754 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-31 17:09:22,755 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-31 17:09:22,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,794 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-31 17:09:22,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:09:22,888 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-31 17:09:22,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-31 17:09:22,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,922 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-31 17:09:22,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:22,943 INFO L267 ElimStorePlain]: Start 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-31 17:09:22,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:27 [2019-01-31 17:09:22,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-31 17:09:22,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:22,970 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-31 17:09:22,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:22,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:09:22,990 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:22,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:09:22,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:09:22,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:09:22,991 INFO L87 Difference]: Start difference. First operand 250 states and 1595 transitions. Second operand 8 states. [2019-01-31 17:09:23,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:23,390 INFO L93 Difference]: Finished difference Result 319 states and 1823 transitions. [2019-01-31 17:09:23,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:09:23,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:09:23,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:23,395 INFO L225 Difference]: With dead ends: 319 [2019-01-31 17:09:23,395 INFO L226 Difference]: Without dead ends: 318 [2019-01-31 17:09:23,395 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-31 17:09:23,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-01-31 17:09:23,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 276. [2019-01-31 17:09:23,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-31 17:09:23,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-01-31 17:09:23,453 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 5 [2019-01-31 17:09:23,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:23,453 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-01-31 17:09:23,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:09:23,453 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-01-31 17:09:23,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:09:23,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:23,454 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 17:09:23,454 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:23,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:23,454 INFO L82 PathProgramCache]: Analyzing trace with hash 904691166, now seen corresponding path program 1 times [2019-01-31 17:09:23,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:23,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:23,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:23,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:23,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:23,627 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-31 17:09:23,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:23,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:23,628 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:09:23,628 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [30], [31] [2019-01-31 17:09:23,629 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:23,629 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:23,631 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:23,631 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-31 17:09:23,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:23,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:23,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:23,632 INFO 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-31 17:09:23,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:23,650 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:23,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:23,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-31 17:09:23,820 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-31 17:09:23,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:23,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:23,827 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-31 17:09:23,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:23,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:23,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:23,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:23,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, 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-31 17:09:23,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:23,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:23,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:23,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:23,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:23,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:23,942 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-31 17:09:23,942 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:23,962 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:23,981 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:24,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:24,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, 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-31 17:09:24,037 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-31 17:09:24,042 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-31 17:09:24,046 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-31 17:09:24,050 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-31 17:09:24,061 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-31 17:09:24,061 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:24,084 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:24,103 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:24,118 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:24,130 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:24,142 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:24,172 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-31 17:09:24,173 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-31 17:09:24,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:24,225 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-31 17:09:24,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:24,250 INFO L267 ElimStorePlain]: Start 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-31 17:09:24,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:09:24,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:24,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:24,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:24,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:24,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:24,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:24,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:24,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, 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-31 17:09:24,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:24,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-31 17:09:24,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:46 [2019-01-31 17:09:24,325 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-31 17:09:24,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:24,344 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-31 17:09:24,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:24,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-31 17:09:24,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:24,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 17:09:24,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 17:09:24,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:09:24,363 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 7 states. [2019-01-31 17:09:24,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:24,581 INFO L93 Difference]: Finished difference Result 290 states and 1801 transitions. [2019-01-31 17:09:24,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:09:24,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-31 17:09:24,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:24,586 INFO L225 Difference]: With dead ends: 290 [2019-01-31 17:09:24,586 INFO L226 Difference]: Without dead ends: 289 [2019-01-31 17:09:24,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:09:24,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-31 17:09:24,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 276. [2019-01-31 17:09:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-31 17:09:24,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-01-31 17:09:24,651 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 6 [2019-01-31 17:09:24,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:24,652 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-01-31 17:09:24,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 17:09:24,652 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-01-31 17:09:24,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:09:24,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:24,653 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-31 17:09:24,653 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:24,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:24,654 INFO L82 PathProgramCache]: Analyzing trace with hash 904323688, now seen corresponding path program 3 times [2019-01-31 17:09:24,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:24,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:24,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:24,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:24,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:24,766 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-31 17:09:24,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:24,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:24,766 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:09:24,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:09:24,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:24,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 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-31 17:09:24,776 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:09:24,776 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:09:24,781 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:09:24,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:09:24,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:24,801 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-31 17:09:24,804 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-31 17:09:24,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:24,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:24,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:09:24,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:24,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:24,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:24,817 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-31 17:09:24,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:24,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:24,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:24,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:24,828 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-31 17:09:24,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:09:24,844 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:24,874 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:24,897 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:24,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:24,930 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:24,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:24,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:24,971 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-31 17:09:25,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,005 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-31 17:09:25,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,045 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-31 17:09:25,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,102 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-31 17:09:25,102 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:25,117 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:25,133 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:25,154 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:25,187 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-31 17:09:25,188 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-31 17:09:25,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:09:25,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:25,257 INFO L267 ElimStorePlain]: Start 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-31 17:09:25,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:09:25,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-31 17:09:25,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:25,321 INFO L267 ElimStorePlain]: Start 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-31 17:09:25,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-31 17:09:25,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,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, 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-31 17:09:25,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:25,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:09:25,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-31 17:09:25,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,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, 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-31 17:09:25,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:25,467 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-31 17:09:25,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-31 17:09:25,483 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-31 17:09:25,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:25,514 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-31 17:09:25,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:25,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-31 17:09:25,534 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:25,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:09:25,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:09:25,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:09:25,535 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 11 states. [2019-01-31 17:09:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:26,135 INFO L93 Difference]: Finished difference Result 423 states and 2543 transitions. [2019-01-31 17:09:26,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:09:26,140 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-31 17:09:26,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:26,144 INFO L225 Difference]: With dead ends: 423 [2019-01-31 17:09:26,145 INFO L226 Difference]: Without dead ends: 421 [2019-01-31 17:09:26,145 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-31 17:09:26,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-01-31 17:09:26,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 325. [2019-01-31 17:09:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-01-31 17:09:26,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 2130 transitions. [2019-01-31 17:09:26,263 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 2130 transitions. Word has length 6 [2019-01-31 17:09:26,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:26,263 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 2130 transitions. [2019-01-31 17:09:26,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:09:26,264 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 2130 transitions. [2019-01-31 17:09:26,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:09:26,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:26,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:09:26,265 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:26,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:26,265 INFO L82 PathProgramCache]: Analyzing trace with hash 904327844, now seen corresponding path program 1 times [2019-01-31 17:09:26,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:26,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:26,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:09:26,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:26,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:26,436 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-31 17:09:26,650 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-31 17:09:26,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:26,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:26,650 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:09:26,650 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [28], [29] [2019-01-31 17:09:26,652 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:26,652 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:26,654 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:26,654 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-31 17:09:26,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:26,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:26,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:26,655 INFO 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-31 17:09:26,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:26,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:26,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:26,694 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-31 17:09:26,697 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-31 17:09:26,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:26,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:26,701 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-31 17:09:26,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:26,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:26,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:26,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-31 17:09:26,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:26,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:26,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:26,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:26,719 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-31 17:09:26,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:26,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:26,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:26,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:26,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:26,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, 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-31 17:09:26,728 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:26,768 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:26,792 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:26,811 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:26,824 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:26,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:26,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:26,872 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-31 17:09:26,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:26,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:26,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, 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-31 17:09:26,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:26,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:26,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:26,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:26,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 46 treesize of output 72 [2019-01-31 17:09:27,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:09:27,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,127 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-31 17:09:27,128 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:27,154 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:27,180 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:27,207 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:27,233 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:27,280 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-31 17:09:27,280 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:09:27,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,313 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-31 17:09:27,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:27,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:09:27,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:09:27,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,396 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-31 17:09:27,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:27,447 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-31 17:09:27,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-31 17:09:27,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:27,490 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:27,491 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-31 17:09:27,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:27,540 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-31 17:09:27,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-01-31 17:09:27,565 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-31 17:09:27,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:27,704 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-31 17:09:27,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:27,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:09:27,723 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:27,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:09:27,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:09:27,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:09:27,723 INFO L87 Difference]: Start difference. First operand 325 states and 2130 transitions. Second operand 10 states. [2019-01-31 17:09:28,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:28,399 INFO L93 Difference]: Finished difference Result 368 states and 2210 transitions. [2019-01-31 17:09:28,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:09:28,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:09:28,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:28,404 INFO L225 Difference]: With dead ends: 368 [2019-01-31 17:09:28,404 INFO L226 Difference]: Without dead ends: 366 [2019-01-31 17:09:28,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:09:28,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-31 17:09:28,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 329. [2019-01-31 17:09:28,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-31 17:09:28,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 2135 transitions. [2019-01-31 17:09:28,467 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 2135 transitions. Word has length 6 [2019-01-31 17:09:28,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:28,467 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 2135 transitions. [2019-01-31 17:09:28,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:09:28,468 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 2135 transitions. [2019-01-31 17:09:28,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:09:28,469 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:28,469 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 17:09:28,469 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:28,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:28,469 INFO L82 PathProgramCache]: Analyzing trace with hash 904329640, now seen corresponding path program 3 times [2019-01-31 17:09:28,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:28,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:28,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:28,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:28,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:28,538 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-31 17:09:28,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:28,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:28,539 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:09:28,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:09:28,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:28,539 INFO 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-31 17:09:28,548 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:09:28,549 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:09:28,556 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:09:28,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:09:28,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:28,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:09:28,581 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-31 17:09:28,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,590 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-31 17:09:28,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,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, 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-31 17:09:28,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,605 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-31 17:09:28,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,615 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-31 17:09:28,616 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:28,659 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:28,681 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:28,699 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:28,713 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:28,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:28,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,759 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-31 17:09:28,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,798 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-31 17:09:28,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09: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, 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-31 17:09:28,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:09:28,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,976 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-31 17:09:28,976 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:29,003 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:29,029 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:29,054 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:29,081 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:29,127 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-31 17:09:29,128 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-31 17:09:29,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,154 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-31 17:09:29,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:29,199 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-31 17:09:29,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-31 17:09:29,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,233 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-31 17:09:29,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:29,283 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-31 17:09:29,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-31 17:09:29,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,319 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:29,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,321 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-31 17:09:29,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:29,374 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-31 17:09:29,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-31 17:09:29,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:29,419 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-31 17:09:29,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:29,474 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-31 17:09:29,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:45 [2019-01-31 17:09:29,498 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-31 17:09:29,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:29,539 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-31 17:09:29,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:29,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:09:29,559 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:29,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:09:29,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:09:29,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:09:29,559 INFO L87 Difference]: Start difference. First operand 329 states and 2135 transitions. Second operand 11 states. [2019-01-31 17:09:30,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:30,361 INFO L93 Difference]: Finished difference Result 407 states and 2353 transitions. [2019-01-31 17:09:30,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:09:30,362 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-31 17:09:30,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:30,367 INFO L225 Difference]: With dead ends: 407 [2019-01-31 17:09:30,367 INFO L226 Difference]: Without dead ends: 401 [2019-01-31 17:09:30,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:09:30,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-01-31 17:09:30,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 341. [2019-01-31 17:09:30,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-31 17:09:30,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 2222 transitions. [2019-01-31 17:09:30,444 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 2222 transitions. Word has length 6 [2019-01-31 17:09:30,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:30,445 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 2222 transitions. [2019-01-31 17:09:30,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:09:30,445 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 2222 transitions. [2019-01-31 17:09:30,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:09:30,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:30,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:09:30,446 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:30,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:30,447 INFO L82 PathProgramCache]: Analyzing trace with hash 904329206, now seen corresponding path program 1 times [2019-01-31 17:09:30,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:30,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:30,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:09:30,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:30,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:30,581 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-31 17:09:30,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:30,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:30,582 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:09:30,582 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [27] [2019-01-31 17:09:30,583 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:30,583 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:30,585 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:30,585 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-31 17:09:30,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:30,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:30,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:30,586 INFO 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-31 17:09:30,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:30,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:30,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:30,624 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-31 17:09:30,627 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-31 17:09:30,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,633 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-31 17:09:30,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,689 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-31 17:09:30,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,696 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-31 17:09:30,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:09:30,706 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:30,746 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:30,770 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:30,789 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:30,802 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:30,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:30,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:09:30,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,891 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-31 17:09:30,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,936 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-31 17:09:30,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:30,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:09:31,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,058 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-31 17:09:31,059 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,084 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,108 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,133 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,158 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,202 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-31 17:09:31,203 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:09:31,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,277 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-31 17:09:31,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,318 INFO L267 ElimStorePlain]: Start 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-31 17:09:31,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:09:31,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,358 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-31 17:09:31,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,405 INFO L267 ElimStorePlain]: Start 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-31 17:09:31,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-31 17:09:31,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,444 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:31,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,446 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-31 17:09:31,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,498 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-31 17:09:31,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-31 17:09:31,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,542 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:31,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,544 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-31 17:09:31,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,595 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-31 17:09:31,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-31 17:09:31,619 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-31 17:09:31,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:31,665 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-31 17:09:31,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:31,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:09:31,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:31,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:09:31,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:09:31,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:09:31,684 INFO L87 Difference]: Start difference. First operand 341 states and 2222 transitions. Second operand 12 states. [2019-01-31 17:09:32,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:32,761 INFO L93 Difference]: Finished difference Result 645 states and 3901 transitions. [2019-01-31 17:09:32,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-31 17:09:32,762 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:09:32,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:32,769 INFO L225 Difference]: With dead ends: 645 [2019-01-31 17:09:32,769 INFO L226 Difference]: Without dead ends: 643 [2019-01-31 17:09:32,769 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-31 17:09:32,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-01-31 17:09:32,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 463. [2019-01-31 17:09:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-01-31 17:09:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 3101 transitions. [2019-01-31 17:09:32,873 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 3101 transitions. Word has length 6 [2019-01-31 17:09:32,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:32,873 INFO L480 AbstractCegarLoop]: Abstraction has 463 states and 3101 transitions. [2019-01-31 17:09:32,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:09:32,874 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 3101 transitions. [2019-01-31 17:09:32,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:09:32,875 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:32,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:09:32,875 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:32,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:32,876 INFO L82 PathProgramCache]: Analyzing trace with hash 904333674, now seen corresponding path program 1 times [2019-01-31 17:09:32,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:32,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:32,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:32,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:32,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:33,028 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-31 17:09:33,472 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2019-01-31 17:09:33,540 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-31 17:09:33,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:33,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:33,541 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:09:33,541 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [30], [31] [2019-01-31 17:09:33,542 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:33,542 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:33,544 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:33,544 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-31 17:09:33,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:33,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:33,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:33,545 INFO 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-31 17:09:33,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:33,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:33,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:33,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-31 17:09:33,623 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-31 17:09:33,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:33,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:33,631 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-31 17:09:33,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:33,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:33,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:33,637 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-31 17:09:33,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:33,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:33,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:33,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:33,645 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-31 17:09:33,657 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-31 17:09:33,658 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:33,693 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:33,714 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:33,732 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:33,744 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:33,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:33,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-31 17:09:33,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:33,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:33,794 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-31 17:09:33,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:33,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:33,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:33,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:33,828 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-31 17:09:33,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:33,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:33,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:33,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:33,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:33,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:33,875 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-31 17:09:33,876 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:33,890 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:33,904 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:33,919 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:33,950 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-31 17:09:33,950 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-31 17:09:34,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:34,041 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-31 17:09:34,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:34,069 INFO L267 ElimStorePlain]: Start 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-31 17:09:34,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:09:34,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:34,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:34,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:34,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:34,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:34,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:34,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:34,108 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-31 17:09:34,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:09:34,207 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-31 17:09:34,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:68 [2019-01-31 17:09:34,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:09:34,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:34,268 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-31 17:09:34,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:34,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-31 17:09:34,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:34,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:09:34,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:09:34,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:09:34,287 INFO L87 Difference]: Start difference. First operand 463 states and 3101 transitions. Second operand 9 states. [2019-01-31 17:09:34,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:34,838 INFO L93 Difference]: Finished difference Result 527 states and 3325 transitions. [2019-01-31 17:09:34,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:09:34,839 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-31 17:09:34,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:34,844 INFO L225 Difference]: With dead ends: 527 [2019-01-31 17:09:34,844 INFO L226 Difference]: Without dead ends: 524 [2019-01-31 17:09:34,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:09:34,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-01-31 17:09:34,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 487. [2019-01-31 17:09:34,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-31 17:09:34,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 3268 transitions. [2019-01-31 17:09:34,957 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 3268 transitions. Word has length 6 [2019-01-31 17:09:34,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:34,957 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 3268 transitions. [2019-01-31 17:09:34,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:09:34,958 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 3268 transitions. [2019-01-31 17:09:34,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:09:34,958 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:34,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:09:34,959 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:34,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:34,959 INFO L82 PathProgramCache]: Analyzing trace with hash 904320156, now seen corresponding path program 1 times [2019-01-31 17:09:34,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:34,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:34,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:34,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:34,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:35,031 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-31 17:09:35,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:35,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:35,031 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:09:35,031 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [28], [29] [2019-01-31 17:09:35,033 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:35,033 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:35,036 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:35,036 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-31 17:09:35,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:35,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:35,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:35,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:09:35,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:35,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:35,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:35,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:09:35,075 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-31 17:09:35,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:09:35,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,090 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-31 17:09:35,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:09:35,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:09:35,119 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:35,149 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:35,170 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:35,188 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:35,203 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:35,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:35,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,242 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-31 17:09:35,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,277 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-31 17:09:35,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:09:35,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,366 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-31 17:09:35,367 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:35,383 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:35,396 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:35,412 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:35,445 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-31 17:09:35,445 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-31 17:09:35,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:09:35,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:35,527 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-31 17:09:35,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:09:35,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:09:35,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:35,596 INFO L267 ElimStorePlain]: Start 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-31 17:09:35,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-31 17:09:35,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,632 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:35,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-31 17:09:35,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:35,671 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-31 17:09:35,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-31 17:09:35,695 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-31 17:09:35,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:35,731 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-31 17:09:35,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:35,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:09:35,752 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:35,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:09:35,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:09:35,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:09:35,752 INFO L87 Difference]: Start difference. First operand 487 states and 3268 transitions. Second operand 10 states. [2019-01-31 17:09:36,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:36,379 INFO L93 Difference]: Finished difference Result 534 states and 3436 transitions. [2019-01-31 17:09:36,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:09:36,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:09:36,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:36,386 INFO L225 Difference]: With dead ends: 534 [2019-01-31 17:09:36,386 INFO L226 Difference]: Without dead ends: 533 [2019-01-31 17:09:36,387 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-31 17:09:36,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-01-31 17:09:36,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 505. [2019-01-31 17:09:36,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-01-31 17:09:36,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 3394 transitions. [2019-01-31 17:09:36,510 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 3394 transitions. Word has length 6 [2019-01-31 17:09:36,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:36,511 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 3394 transitions. [2019-01-31 17:09:36,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:09:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 3394 transitions. [2019-01-31 17:09:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:09:36,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:36,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:09:36,512 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:36,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:36,513 INFO L82 PathProgramCache]: Analyzing trace with hash 904806422, now seen corresponding path program 1 times [2019-01-31 17:09:36,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:36,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:36,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:36,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:36,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:36,572 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-31 17:09:36,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:36,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:36,573 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:09:36,573 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [28], [29] [2019-01-31 17:09:36,573 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:36,574 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:36,577 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:36,578 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-31 17:09:36,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:36,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:36,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:36,578 INFO 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-31 17:09:36,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:36,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:36,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:36,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:09:36,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:09:36,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,620 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-31 17:09:36,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:09:36,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,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, 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-31 17:09:36,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:09:36,662 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:36,699 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:36,720 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:36,737 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:36,750 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:36,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:36,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-31 17:09:36,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,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, 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-31 17:09:36,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:09:36,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:09:36,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,986 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-31 17:09:36,987 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:37,010 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:37,034 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:37,059 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:37,086 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:37,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:09:37,128 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-31 17:09:37,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:37,190 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-31 17:09:37,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:37,232 INFO L267 ElimStorePlain]: Start 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-31 17:09:37,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-31 17:09:37,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:37,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:37,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:37,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:37,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:37,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:37,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:37,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:37,273 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-31 17:09:37,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:37,316 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-31 17:09:37,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-01-31 17:09:37,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:37,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:37,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:37,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:37,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:37,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:37,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:37,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:37,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:37,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:37,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:37,356 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:37,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:37,358 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-31 17:09:37,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:37,406 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-31 17:09:37,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:43 [2019-01-31 17:09:37,431 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-31 17:09:37,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:37,468 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-31 17:09:37,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:37,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:09:37,487 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:37,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:09:37,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:09:37,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:09:37,488 INFO L87 Difference]: Start difference. First operand 505 states and 3394 transitions. Second operand 10 states. [2019-01-31 17:09:38,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:38,107 INFO L93 Difference]: Finished difference Result 543 states and 3439 transitions. [2019-01-31 17:09:38,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:09:38,107 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:09:38,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:38,112 INFO L225 Difference]: With dead ends: 543 [2019-01-31 17:09:38,113 INFO L226 Difference]: Without dead ends: 542 [2019-01-31 17:09:38,113 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-31 17:09:38,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-01-31 17:09:38,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 500. [2019-01-31 17:09:38,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-01-31 17:09:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3359 transitions. [2019-01-31 17:09:38,241 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3359 transitions. Word has length 6 [2019-01-31 17:09:38,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:38,241 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3359 transitions. [2019-01-31 17:09:38,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:09:38,241 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3359 transitions. [2019-01-31 17:09:38,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:09:38,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:38,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:09:38,243 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:38,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:38,243 INFO L82 PathProgramCache]: Analyzing trace with hash 904796812, now seen corresponding path program 1 times [2019-01-31 17:09:38,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:38,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:38,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:38,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:38,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:38,387 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-31 17:09:38,514 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-31 17:09:38,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:38,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:38,515 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:09:38,515 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [28], [29] [2019-01-31 17:09:38,515 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:38,516 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:38,518 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:38,518 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-31 17:09:38,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:38,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:38,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:38,519 INFO 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-31 17:09:38,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:38,528 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:38,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:38,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, 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-31 17:09:38,542 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-31 17:09:38,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,547 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-31 17:09:38,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:09:38,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,570 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-31 17:09:38,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:09:38,581 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:38,622 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:38,644 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:38,662 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:38,673 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:38,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:38,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-31 17:09:38,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,733 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-31 17:09:38,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-31 17:09:38,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,830 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-31 17:09:38,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:38,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 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-31 17:09:38,900 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:38,923 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:38,948 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:38,972 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:39,014 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:39,058 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-31 17:09:39,059 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-31 17:09:39,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,092 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-31 17:09:39,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:39,134 INFO L267 ElimStorePlain]: Start 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-31 17:09:39,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-31 17:09:39,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,169 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-31 17:09:39,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:39,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:09:39,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-01-31 17:09:39,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,252 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:39,253 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-31 17:09:39,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:39,304 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-31 17:09:39,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-01-31 17:09:39,329 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-31 17:09:39,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:39,365 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-31 17:09:39,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:39,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:09:39,383 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:39,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:09:39,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:09:39,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:09:39,384 INFO L87 Difference]: Start difference. First operand 500 states and 3359 transitions. Second operand 10 states. [2019-01-31 17:09:40,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:40,049 INFO L93 Difference]: Finished difference Result 537 states and 3427 transitions. [2019-01-31 17:09:40,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:09:40,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:09:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:40,054 INFO L225 Difference]: With dead ends: 537 [2019-01-31 17:09:40,054 INFO L226 Difference]: Without dead ends: 536 [2019-01-31 17:09:40,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:09:40,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-01-31 17:09:40,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 501. [2019-01-31 17:09:40,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-01-31 17:09:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 3366 transitions. [2019-01-31 17:09:40,181 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 3366 transitions. Word has length 6 [2019-01-31 17:09:40,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:40,181 INFO L480 AbstractCegarLoop]: Abstraction has 501 states and 3366 transitions. [2019-01-31 17:09:40,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:09:40,181 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 3366 transitions. [2019-01-31 17:09:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:09:40,182 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:40,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:09:40,182 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:40,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:40,182 INFO L82 PathProgramCache]: Analyzing trace with hash 904848706, now seen corresponding path program 1 times [2019-01-31 17:09:40,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:40,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:40,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:40,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:40,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:40,339 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-31 17:09:40,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:40,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:40,339 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:09:40,340 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [29] [2019-01-31 17:09:40,340 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:40,340 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:40,343 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:40,343 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-31 17:09:40,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:40,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:40,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:40,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 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-31 17:09:40,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:40,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:40,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:40,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:09:40,426 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-31 17:09:40,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,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, 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-31 17:09:40,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:09:40,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,446 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-31 17:09:40,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,458 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-31 17:09:40,459 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:40,556 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:40,578 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:40,595 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:40,609 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:40,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:40,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:09:40,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,694 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-31 17:09:40,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,741 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-31 17:09:40,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:09:40,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:40,868 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-31 17:09:40,868 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:40,893 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:40,919 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:40,945 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:40,972 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:41,019 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-31 17:09:41,020 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:09:41,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:41,059 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-31 17:09:41,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:41,173 INFO L267 ElimStorePlain]: Start 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-31 17:09:41,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:09:41,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:41,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:41,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:41,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:41,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:41,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:41,205 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:41,206 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-31 17:09:41,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:41,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-31 17:09:41,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-01-31 17:09:41,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:41,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:41,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:41,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:41,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:41,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:41,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:41,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:41,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:41,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:41,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:41,287 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-31 17:09:41,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:41,336 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-31 17:09:41,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-31 17:09:41,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:09:41,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:41,410 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-31 17:09:41,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:41,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:09:41,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:41,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:09:41,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:09:41,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:09:41,430 INFO L87 Difference]: Start difference. First operand 501 states and 3366 transitions. Second operand 10 states. [2019-01-31 17:09:42,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:42,151 INFO L93 Difference]: Finished difference Result 588 states and 3737 transitions. [2019-01-31 17:09:42,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:09:42,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:09:42,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:42,156 INFO L225 Difference]: With dead ends: 588 [2019-01-31 17:09:42,156 INFO L226 Difference]: Without dead ends: 587 [2019-01-31 17:09:42,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:09:42,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-01-31 17:09:42,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 534. [2019-01-31 17:09:42,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-01-31 17:09:42,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 3605 transitions. [2019-01-31 17:09:42,279 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 3605 transitions. Word has length 6 [2019-01-31 17:09:42,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:42,279 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 3605 transitions. [2019-01-31 17:09:42,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:09:42,279 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 3605 transitions. [2019-01-31 17:09:42,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:09:42,280 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:42,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:09:42,280 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:42,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:42,281 INFO L82 PathProgramCache]: Analyzing trace with hash 904869912, now seen corresponding path program 1 times [2019-01-31 17:09:42,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:42,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:42,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:42,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:42,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:09:42,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:42,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:42,329 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:09:42,330 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [28], [30], [31] [2019-01-31 17:09:42,330 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:42,330 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:42,333 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:42,333 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-31 17:09:42,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:42,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:42,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:42,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:09:42,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:42,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:42,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:42,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-31 17:09:42,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:09:42,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,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, 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-31 17:09:42,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,436 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-31 17:09:42,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,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, 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-31 17:09:42,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:09:42,456 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:42,493 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:42,515 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:42,532 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:42,544 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:42,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:42,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-31 17:09:42,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,605 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-31 17:09:42,752 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-01-31 17:09:42,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,761 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-31 17:09:42,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-31 17:09:42,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,886 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-31 17:09:42,886 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:42,911 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:42,936 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:42,960 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:42,987 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:43,030 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-31 17:09:43,031 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-31 17:09:43,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,060 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-31 17:09:43,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:43,103 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-31 17:09:43,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-31 17:09:43,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:43,131 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:43,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 102 [2019-01-31 17:09:43,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:43,176 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-31 17:09:43,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:55 [2019-01-31 17:09:43,198 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-31 17:09:43,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:43,220 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-31 17:09:43,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:43,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:09:43,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:43,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:09:43,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:09:43,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:09:43,241 INFO L87 Difference]: Start difference. First operand 534 states and 3605 transitions. Second operand 8 states. [2019-01-31 17:09:43,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:43,740 INFO L93 Difference]: Finished difference Result 558 states and 3635 transitions. [2019-01-31 17:09:43,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:09:43,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:09:43,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:43,744 INFO L225 Difference]: With dead ends: 558 [2019-01-31 17:09:43,745 INFO L226 Difference]: Without dead ends: 557 [2019-01-31 17:09:43,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 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-31 17:09:43,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-01-31 17:09:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 533. [2019-01-31 17:09:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-01-31 17:09:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 3598 transitions. [2019-01-31 17:09:43,865 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 3598 transitions. Word has length 6 [2019-01-31 17:09:43,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:43,865 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 3598 transitions. [2019-01-31 17:09:43,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:09:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 3598 transitions. [2019-01-31 17:09:43,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:09:43,866 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:43,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:09:43,867 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:43,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:43,867 INFO L82 PathProgramCache]: Analyzing trace with hash 904431632, now seen corresponding path program 1 times [2019-01-31 17:09:43,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:43,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:43,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:43,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:43,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:44,062 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-31 17:09:44,095 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-31 17:09:44,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:44,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:44,096 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:09:44,096 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [29] [2019-01-31 17:09:44,097 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:44,097 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:44,099 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:44,100 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-31 17:09:44,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:44,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:44,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:44,101 INFO 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-31 17:09:44,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:44,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:44,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:44,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,148 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-31 17:09:44,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,181 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-31 17:09:44,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:09:44,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,269 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-31 17:09:44,270 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:44,287 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:44,302 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:44,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:44,343 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-31 17:09:44,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, 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-31 17:09:44,350 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-31 17:09:44,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:09:44,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:09:44,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-31 17:09:44,363 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:44,387 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:44,407 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:44,422 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:44,434 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:44,446 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:44,479 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-31 17:09:44,479 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:09:44,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:09:44,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:44,543 INFO L267 ElimStorePlain]: Start 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-31 17:09:44,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:09:44,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,568 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:44,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-31 17:09:44,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:44,601 INFO L267 ElimStorePlain]: Start 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-31 17:09:44,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-01-31 17:09:44,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:44,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-31 17:09:44,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:44,665 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-31 17:09:44,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-31 17:09:44,685 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-31 17:09:44,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:44,707 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-31 17:09:44,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:44,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:09:44,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:44,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:09:44,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:09:44,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:09:44,728 INFO L87 Difference]: Start difference. First operand 533 states and 3598 transitions. Second operand 10 states. [2019-01-31 17:09:45,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:45,439 INFO L93 Difference]: Finished difference Result 795 states and 5176 transitions. [2019-01-31 17:09:45,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:09:45,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:09:45,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:45,444 INFO L225 Difference]: With dead ends: 795 [2019-01-31 17:09:45,444 INFO L226 Difference]: Without dead ends: 794 [2019-01-31 17:09:45,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:09:45,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-01-31 17:09:45,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 484. [2019-01-31 17:09:45,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-01-31 17:09:45,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 3230 transitions. [2019-01-31 17:09:45,594 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 3230 transitions. Word has length 6 [2019-01-31 17:09:45,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:45,594 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 3230 transitions. [2019-01-31 17:09:45,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:09:45,594 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 3230 transitions. [2019-01-31 17:09:45,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:09:45,595 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:45,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:09:45,596 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:45,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:45,596 INFO L82 PathProgramCache]: Analyzing trace with hash 904452838, now seen corresponding path program 1 times [2019-01-31 17:09:45,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:45,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:45,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:45,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:45,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:45,751 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-31 17:09:45,793 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-31 17:09:45,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:45,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:45,793 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:09:45,793 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [28], [30], [31] [2019-01-31 17:09:45,794 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:45,794 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:45,798 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:45,798 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-31 17:09:45,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:45,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:45,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:45,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:09:45,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:45,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:45,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:45,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-31 17:09:45,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, 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-31 17:09:45,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:45,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:45,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-31 17:09:45,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:45,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:45,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:45,836 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-31 17:09:45,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:45,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:45,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:45,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:45,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-31 17:09:45,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:09:45,857 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:45,882 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:45,904 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:45,921 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:45,934 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:45,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:45,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-31 17:09:45,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:45,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:45,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, 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-31 17:09:46,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,025 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-31 17:09:46,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,072 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-31 17:09:46,073 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:46,086 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:46,100 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:46,117 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:46,147 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-31 17:09:46,148 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-31 17:09:46,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,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, 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-31 17:09:46,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:46,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:09:46,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:09:46,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,246 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:46,255 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-31 17:09:46,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:09:46,349 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-31 17:09:46,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:76 [2019-01-31 17:09:46,412 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-31 17:09:46,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:46,438 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-31 17:09:46,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:46,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-31 17:09:46,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:46,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:09:46,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:09:46,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:09:46,458 INFO L87 Difference]: Start difference. First operand 484 states and 3230 transitions. Second operand 9 states. [2019-01-31 17:09:47,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:47,251 INFO L93 Difference]: Finished difference Result 539 states and 3425 transitions. [2019-01-31 17:09:47,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:09:47,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-31 17:09:47,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:47,255 INFO L225 Difference]: With dead ends: 539 [2019-01-31 17:09:47,255 INFO L226 Difference]: Without dead ends: 538 [2019-01-31 17:09:47,256 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-31 17:09:47,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-01-31 17:09:47,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 500. [2019-01-31 17:09:47,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-01-31 17:09:47,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3342 transitions. [2019-01-31 17:09:47,472 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3342 transitions. Word has length 6 [2019-01-31 17:09:47,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:47,473 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3342 transitions. [2019-01-31 17:09:47,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:09:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3342 transitions. [2019-01-31 17:09:47,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:09:47,474 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:47,474 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 17:09:47,474 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:47,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:47,474 INFO L82 PathProgramCache]: Analyzing trace with hash 893599114, now seen corresponding path program 4 times [2019-01-31 17:09:47,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:47,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:47,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:47,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:47,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:47,560 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-31 17:09:47,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:47,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:47,560 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:09:47,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:09:47,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:47,561 INFO 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-31 17:09:47,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:47,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:47,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:47,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, 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-31 17:09:47,601 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-31 17:09:47,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:47,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:47,607 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-31 17:09:47,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:47,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:47,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:47,615 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-31 17:09:47,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:47,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:47,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:47,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:47,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:09:47,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, 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-31 17:09:47,631 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:47,661 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:47,684 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:47,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:47,715 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:47,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:47,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:47,756 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-31 17:09:47,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:47,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:47,791 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-31 17:09:47,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:47,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:47,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:47,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:47,847 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-31 17:09:47,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:47,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:47,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:47,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:47,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:47,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:47,914 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-31 17:09:47,914 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:47,931 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:47,947 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:47,963 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:47,996 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-31 17:09:47,997 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:09:48,225 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-31 17:09:48,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:48,262 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-31 17:09:48,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:09:48,387 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-31 17:09:48,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-01-31 17:09:48,610 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-31 17:09:48,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:48,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:48,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:48,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:48,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:48,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:48,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:48,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:09:48,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:48,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:48,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:48,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:48,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:48,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:48,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:48,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:48,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:48,715 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-31 17:09:48,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-31 17:09:48,842 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-31 17:09:48,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:129, output treesize:126 [2019-01-31 17:09:49,069 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-01-31 17:09:49,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:09:49,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:49,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,211 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-31 17:09:49,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:49,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:09:49,316 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:49,401 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-31 17:09:49,401 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:159, output treesize:123 [2019-01-31 17:09:49,633 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-31 17:09:49,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,682 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-31 17:09:49,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-31 17:09:50,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:50,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:50,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:50,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:50,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:50,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:50,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:50,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:50,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:50,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:50,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:50,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:50,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:50,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, 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-31 17:09:50,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:50,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:50,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:50,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:50,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:50,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:50,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:50,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:50,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:50,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:50,181 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:50,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:50,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-31 17:09:50,184 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:50,320 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-31 17:09:50,320 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:238 [2019-01-31 17:09:50,461 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-31 17:09:50,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:50,554 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-31 17:09:50,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:50,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:09:50,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:50,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:09:50,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:09:50,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:09:50,573 INFO L87 Difference]: Start difference. First operand 500 states and 3342 transitions. Second operand 11 states. [2019-01-31 17:09:50,815 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-31 17:09:51,449 WARN L181 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-01-31 17:09:51,927 WARN L181 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-01-31 17:09:52,455 WARN L181 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-01-31 17:09:53,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:53,335 INFO L93 Difference]: Finished difference Result 678 states and 4253 transitions. [2019-01-31 17:09:53,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:09:53,335 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-31 17:09:53,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:53,341 INFO L225 Difference]: With dead ends: 678 [2019-01-31 17:09:53,341 INFO L226 Difference]: Without dead ends: 673 [2019-01-31 17:09:53,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-01-31 17:09:53,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-01-31 17:09:53,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 555. [2019-01-31 17:09:53,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-01-31 17:09:53,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 3727 transitions. [2019-01-31 17:09:53,565 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 3727 transitions. Word has length 6 [2019-01-31 17:09:53,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:53,565 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 3727 transitions. [2019-01-31 17:09:53,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:09:53,565 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 3727 transitions. [2019-01-31 17:09:53,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:09:53,566 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:53,566 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 17:09:53,566 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:53,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:53,567 INFO L82 PathProgramCache]: Analyzing trace with hash 893598680, now seen corresponding path program 2 times [2019-01-31 17:09:53,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:53,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:53,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:53,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:53,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:53,701 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-31 17:09:53,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:53,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:53,701 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:09:53,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:09:53,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:53,702 INFO 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-31 17:09:53,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:09:53,712 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:09:53,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:09:53,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:09:53,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:53,742 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-31 17:09:53,745 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-31 17:09:53,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,750 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-31 17:09:53,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,758 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-31 17:09:53,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,766 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-31 17:09:53,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:09:53,779 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:53,822 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:53,846 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:53,865 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:53,881 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:53,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:53,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,930 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-31 17:09:53,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,970 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-31 17:09:54,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,014 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-31 17:09:54,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:09:54,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,144 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-31 17:09:54,145 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:54,172 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:54,198 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:54,225 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:54,252 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:54,299 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-31 17:09:54,300 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-31 17:09:54,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,369 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-31 17:09:54,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:54,444 INFO L267 ElimStorePlain]: Start 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-31 17:09:54,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:09:54,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,491 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-31 17:09:54,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:54,539 INFO L267 ElimStorePlain]: Start 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-31 17:09:54,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-31 17:09:54,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,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, 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-31 17:09:54,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:54,635 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-31 17:09:54,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:55 [2019-01-31 17:09:54,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:54,684 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-31 17:09:54,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:54,740 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-31 17:09:54,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:45 [2019-01-31 17:09:54,764 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-31 17:09:54,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:54,814 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-31 17:09:54,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:54,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:09:54,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:54,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:09:54,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:09:54,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:09:54,833 INFO L87 Difference]: Start difference. First operand 555 states and 3727 transitions. Second operand 11 states. [2019-01-31 17:09:55,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:55,667 INFO L93 Difference]: Finished difference Result 704 states and 4501 transitions. [2019-01-31 17:09:55,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:09:55,668 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-31 17:09:55,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:55,673 INFO L225 Difference]: With dead ends: 704 [2019-01-31 17:09:55,673 INFO L226 Difference]: Without dead ends: 703 [2019-01-31 17:09:55,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:09:55,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-01-31 17:09:55,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 655. [2019-01-31 17:09:55,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-01-31 17:09:55,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 4427 transitions. [2019-01-31 17:09:55,920 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 4427 transitions. Word has length 6 [2019-01-31 17:09:55,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:55,920 INFO L480 AbstractCegarLoop]: Abstraction has 655 states and 4427 transitions. [2019-01-31 17:09:55,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:09:55,920 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 4427 transitions. [2019-01-31 17:09:55,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:09:55,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:55,921 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:09:55,922 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:55,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:55,922 INFO L82 PathProgramCache]: Analyzing trace with hash 893604446, now seen corresponding path program 2 times [2019-01-31 17:09:55,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:55,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:55,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:09:55,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:55,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:56,117 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-31 17:09:56,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:56,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:56,118 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:09:56,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:09:56,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:56,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 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-31 17:09:56,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:09:56,127 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:09:56,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:09:56,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:09:56,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:56,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:09:56,174 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-31 17:09:56,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,178 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-31 17:09:56,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,185 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-31 17:09:56,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,204 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-31 17:09:56,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,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, 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-31 17:09:56,213 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:56,251 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:56,274 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:56,292 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:56,306 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:56,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:56,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,352 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-31 17:09:56,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:09:56,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,441 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-31 17:09:56,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:09:56,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,565 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-31 17:09:56,566 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:56,589 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:56,615 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:56,642 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:56,668 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:56,715 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-31 17:09:56,715 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:09:56,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,752 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-31 17:09:56,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:56,798 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-31 17:09:56,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-31 17:09:56,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,833 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-31 17:09:56,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:56,880 INFO L267 ElimStorePlain]: Start 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-31 17:09:56,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-31 17:09:56,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,917 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:56,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,919 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-31 17:09:56,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:56,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-31 17:09:56,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-31 17:09:56,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:57,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:57,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:57,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:57,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:57,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:57,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:57,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:57,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:57,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:57,009 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:57,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:57,011 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-31 17:09:57,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:57,063 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-31 17:09:57,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-31 17:09:59,620 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-31 17:09:59,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:59,670 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-31 17:09:59,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:59,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:09:59,690 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:59,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:09:59,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:09:59,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:09:59,690 INFO L87 Difference]: Start difference. First operand 655 states and 4427 transitions. Second operand 12 states. [2019-01-31 17:10:11,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:11,292 INFO L93 Difference]: Finished difference Result 1218 states and 7896 transitions. [2019-01-31 17:10:11,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 17:10:11,293 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:10:11,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:11,300 INFO L225 Difference]: With dead ends: 1218 [2019-01-31 17:10:11,300 INFO L226 Difference]: Without dead ends: 1217 [2019-01-31 17:10:11,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:10:11,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2019-01-31 17:10:11,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 738. [2019-01-31 17:10:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-01-31 17:10:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 5008 transitions. [2019-01-31 17:10:11,641 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 5008 transitions. Word has length 6 [2019-01-31 17:10:11,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:11,641 INFO L480 AbstractCegarLoop]: Abstraction has 738 states and 5008 transitions. [2019-01-31 17:10:11,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:10:11,641 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 5008 transitions. [2019-01-31 17:10:11,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:10:11,642 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:11,642 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:10:11,642 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:11,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:11,643 INFO L82 PathProgramCache]: Analyzing trace with hash 893724170, now seen corresponding path program 1 times [2019-01-31 17:10:11,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:11,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:11,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:10:11,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:11,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:11,787 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-31 17:10:11,825 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-31 17:10:11,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:11,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:11,825 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:10:11,825 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [29] [2019-01-31 17:10:11,826 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:10:11,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:10:11,829 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:10:11,829 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-31 17:10:11,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:11,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:10:11,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:11,829 INFO 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-31 17:10:11,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:11,848 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:10:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:11,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:11,875 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-31 17:10:11,879 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-31 17:10:11,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:11,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:11,884 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-31 17:10:11,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:11,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:11,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:11,891 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-31 17:10:11,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:11,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:11,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:11,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:11,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, 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-31 17:10:11,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:11,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:11,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:11,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:11,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:11,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-31 17:10:11,909 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:11,951 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:11,973 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:11,989 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:12,003 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:12,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:12,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,050 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-31 17:10:12,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,095 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-31 17:10:12,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:10:12,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:10:12,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,271 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-31 17:10:12,272 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:12,297 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:12,323 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:12,350 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:12,378 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:12,444 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-31 17:10:12,444 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:10:12,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:10:12,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:12,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:10:12,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:10:12,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,562 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:12,563 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-31 17:10:12,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:12,609 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-31 17:10:12,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:59 [2019-01-31 17:10:12,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,650 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-31 17:10:12,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:12,699 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-31 17:10:12,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:47 [2019-01-31 17:10:12,725 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-31 17:10:12,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:12,761 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-31 17:10:12,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:12,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:10:12,779 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:12,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:10:12,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:10:12,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:10:12,780 INFO L87 Difference]: Start difference. First operand 738 states and 5008 transitions. Second operand 10 states. [2019-01-31 17:10:13,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:13,592 INFO L93 Difference]: Finished difference Result 814 states and 5311 transitions. [2019-01-31 17:10:13,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:10:13,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:10:13,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:13,596 INFO L225 Difference]: With dead ends: 814 [2019-01-31 17:10:13,596 INFO L226 Difference]: Without dead ends: 811 [2019-01-31 17:10:13,596 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-31 17:10:13,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-01-31 17:10:13,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 775. [2019-01-31 17:10:13,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-01-31 17:10:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 5267 transitions. [2019-01-31 17:10:13,913 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 5267 transitions. Word has length 6 [2019-01-31 17:10:13,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:13,914 INFO L480 AbstractCegarLoop]: Abstraction has 775 states and 5267 transitions. [2019-01-31 17:10:13,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:10:13,914 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 5267 transitions. [2019-01-31 17:10:13,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:10:13,915 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:13,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:10:13,915 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:13,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:13,915 INFO L82 PathProgramCache]: Analyzing trace with hash 893714560, now seen corresponding path program 1 times [2019-01-31 17:10:13,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:13,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:13,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:13,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:13,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:13,997 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-31 17:10:13,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:13,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:13,998 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:10:13,998 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [28], [29] [2019-01-31 17:10:13,999 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:10:13,999 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:10:14,001 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:10:14,001 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-31 17:10:14,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:14,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:10:14,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:14,002 INFO 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-31 17:10:14,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:14,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:10:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:14,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:14,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,038 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-31 17:10:14,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,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, 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-31 17:10:14,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,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 32 treesize of output 61 [2019-01-31 17:10:14,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,161 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-31 17:10:14,162 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:14,180 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:14,197 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:14,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:14,239 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-31 17:10:14,242 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-31 17:10:14,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:10:14,247 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-31 17:10:14,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, 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-31 17:10:14,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, 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-31 17:10:14,257 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:14,285 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:14,306 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:14,322 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:14,336 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:14,346 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:14,379 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-31 17:10:14,379 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-31 17:10:14,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:10:14,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:14,467 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-31 17:10:14,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:10:14,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,497 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:14,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:10:14,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:14,530 INFO L267 ElimStorePlain]: Start 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-31 17:10:14,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-31 17:10:14,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:14,563 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:14,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, 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-31 17:10:14,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:14,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-31 17:10:14,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-31 17:10:14,617 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-31 17:10:14,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:14,656 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-31 17:10:14,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:14,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:10:14,674 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:14,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:10:14,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:10:14,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:10:14,675 INFO L87 Difference]: Start difference. First operand 775 states and 5267 transitions. Second operand 9 states. [2019-01-31 17:10:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:15,587 INFO L93 Difference]: Finished difference Result 812 states and 5339 transitions. [2019-01-31 17:10:15,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:10:15,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-31 17:10:15,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:15,590 INFO L225 Difference]: With dead ends: 812 [2019-01-31 17:10:15,591 INFO L226 Difference]: Without dead ends: 811 [2019-01-31 17:10:15,591 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-31 17:10:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-01-31 17:10:15,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 780. [2019-01-31 17:10:15,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-01-31 17:10:15,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 5302 transitions. [2019-01-31 17:10:15,891 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 5302 transitions. Word has length 6 [2019-01-31 17:10:15,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:15,891 INFO L480 AbstractCegarLoop]: Abstraction has 780 states and 5302 transitions. [2019-01-31 17:10:15,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:10:15,891 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 5302 transitions. [2019-01-31 17:10:15,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:10:15,892 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:15,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:10:15,892 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:15,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:15,893 INFO L82 PathProgramCache]: Analyzing trace with hash 893787660, now seen corresponding path program 1 times [2019-01-31 17:10:15,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:15,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:15,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:15,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:15,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:15,976 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-31 17:10:15,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:15,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:15,976 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:10:15,977 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [30], [31] [2019-01-31 17:10:15,977 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:10:15,977 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:10:15,979 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:10:15,979 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-31 17:10:15,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:15,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:10:15,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:15,980 INFO 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-31 17:10:15,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:15,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:10:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:15,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:16,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:10:16,050 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-31 17:10:16,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,095 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-31 17:10:16,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:10:16,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,113 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-31 17:10:16,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,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, 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-31 17:10:16,125 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:16,165 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:16,184 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:16,202 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:16,216 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:16,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:16,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-31 17:10:16,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,278 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-31 17:10:16,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,323 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-31 17:10:16,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:10:16,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,450 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-31 17:10:16,451 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:16,475 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:16,500 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:16,525 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:16,552 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:16,596 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-31 17:10:16,596 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-31 17:10:16,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,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, 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-31 17:10:16,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:10:17,045 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-31 17:10:17,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-01-31 17:10:17,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:17,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:17,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:17,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-31 17:10:17,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:17,127 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-31 17:10:17,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:38 [2019-01-31 17:10:17,149 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-31 17:10:17,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:17,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:10:17,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:17,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:10:17,189 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:17,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:10:17,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:10:17,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:10:17,189 INFO L87 Difference]: Start difference. First operand 780 states and 5302 transitions. Second operand 8 states. [2019-01-31 17:10:17,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:17,892 INFO L93 Difference]: Finished difference Result 843 states and 5575 transitions. [2019-01-31 17:10:17,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:10:17,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:10:17,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:17,896 INFO L225 Difference]: With dead ends: 843 [2019-01-31 17:10:17,896 INFO L226 Difference]: Without dead ends: 842 [2019-01-31 17:10:17,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:10:17,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-01-31 17:10:18,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 813. [2019-01-31 17:10:18,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-01-31 17:10:18,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 5533 transitions. [2019-01-31 17:10:18,212 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 5533 transitions. Word has length 6 [2019-01-31 17:10:18,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:18,212 INFO L480 AbstractCegarLoop]: Abstraction has 813 states and 5533 transitions. [2019-01-31 17:10:18,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:10:18,212 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 5533 transitions. [2019-01-31 17:10:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:10:18,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:18,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:10:18,214 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:18,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:18,214 INFO L82 PathProgramCache]: Analyzing trace with hash 893774142, now seen corresponding path program 1 times [2019-01-31 17:10:18,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:18,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:18,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:18,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:18,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:18,272 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-31 17:10:18,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:18,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:18,273 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:10:18,273 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [29] [2019-01-31 17:10:18,274 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:10:18,274 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:10:18,276 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:10:18,277 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-31 17:10:18,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:18,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:10:18,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:18,278 INFO 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-31 17:10:18,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:18,290 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:10:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:18,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:18,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:18,319 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-31 17:10:18,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:18,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:18,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, 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-31 17:10:18,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:18,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:18,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:18,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:18,399 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-31 17:10:18,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:18,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:18,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:18,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:18,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:18,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:18,451 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-31 17:10:18,452 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:18,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:18,495 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:18,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:18,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, 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-31 17:10:18,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, 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-31 17:10:18,552 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-31 17:10:18,555 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-31 17:10:18,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:10:18,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:10:18,568 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:18,595 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:18,615 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:18,631 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:18,644 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:18,656 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:18,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:10:18,690 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-31 17:10:18,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:18,806 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-31 17:10:18,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:10:18,940 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-31 17:10:18,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-01-31 17:10:19,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,094 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-31 17:10:19,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-31 17:10:19,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,421 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:19,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, 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-31 17:10:19,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:19,586 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-31 17:10:19,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:126, output treesize:278 [2019-01-31 17:10:19,793 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 103 [2019-01-31 17:10:19,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 88 [2019-01-31 17:10:19,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:19,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,928 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:19,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:19,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 100 [2019-01-31 17:10:19,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:20,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,061 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:20,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-31 17:10:20,063 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:20,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,187 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:20,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-31 17:10:20,188 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:20,290 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-31 17:10:20,291 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:227, output treesize:173 [2019-01-31 17:10:22,930 WARN L181 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-01-31 17:10:22,934 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-31 17:10:22,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:10:23,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:23,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:10:23,008 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:23,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:10:23,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:10:23,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:10:23,008 INFO L87 Difference]: Start difference. First operand 813 states and 5533 transitions. Second operand 10 states. [2019-01-31 17:10:23,201 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-01-31 17:10:23,422 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-31 17:10:54,060 WARN L181 SmtUtils]: Spent 30.38 s on a formula simplification. DAG size of input: 112 DAG size of output: 87 [2019-01-31 17:10:57,728 WARN L181 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-01-31 17:10:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:58,032 INFO L93 Difference]: Finished difference Result 896 states and 5824 transitions. [2019-01-31 17:10:58,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:10:58,032 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:10:58,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:58,034 INFO L225 Difference]: With dead ends: 896 [2019-01-31 17:10:58,035 INFO L226 Difference]: Without dead ends: 895 [2019-01-31 17:10:58,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 34.4s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:10:58,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-01-31 17:10:58,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 848. [2019-01-31 17:10:58,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-01-31 17:10:58,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 5778 transitions. [2019-01-31 17:10:58,365 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 5778 transitions. Word has length 6 [2019-01-31 17:10:58,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:58,365 INFO L480 AbstractCegarLoop]: Abstraction has 848 states and 5778 transitions. [2019-01-31 17:10:58,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:10:58,365 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 5778 transitions. [2019-01-31 17:10:58,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:10:58,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:58,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:10:58,367 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:58,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:58,367 INFO L82 PathProgramCache]: Analyzing trace with hash 893364756, now seen corresponding path program 1 times [2019-01-31 17:10:58,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:58,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:58,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:58,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:58,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:58,441 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-31 17:10:58,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:58,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:58,442 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:10:58,442 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [22], [28], [29] [2019-01-31 17:10:58,443 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:10:58,443 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:10:58,445 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:10:58,445 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-31 17:10:58,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:58,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:10:58,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:58,446 INFO 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-31 17:10:58,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:58,456 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:10:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:58,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:58,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:58,480 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-31 17:10:58,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:58,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:58,511 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-31 17:10:58,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:58,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:58,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:58,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:58,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, 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-31 17:10:58,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:58,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:58,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:58,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:58,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:58,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:58,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:10:58,603 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:58,621 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:58,635 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:58,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:58,677 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-31 17:10:58,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:10:58,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:10:58,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:10:58,688 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-31 17:10:58,696 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-31 17:10:58,697 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:58,724 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:58,745 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:58,761 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:58,775 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:58,787 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:58,820 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-31 17:10:58,821 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:10:58,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:58,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:10:58,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:58,895 INFO L267 ElimStorePlain]: Start 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-31 17:10:58,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:10:58,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:58,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:58,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:58,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:58,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:58,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:58,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:58,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-31 17:10:58,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:58,956 INFO L267 ElimStorePlain]: Start 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-31 17:10:58,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-31 17:10:59,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:59,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:59,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:59,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:59,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:59,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:59,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:59,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:59,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:59,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:59,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:59,231 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:59,233 INFO L303 Elim1Store]: Index analysis took 256 ms [2019-01-31 17:10:59,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-31 17:10:59,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:59,358 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-31 17:10:59,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-31 17:10:59,381 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-31 17:10:59,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:59,413 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-31 17:10:59,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:59,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:10:59,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:59,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:10:59,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:10:59,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:10:59,433 INFO L87 Difference]: Start difference. First operand 848 states and 5778 transitions. Second operand 10 states. [2019-01-31 17:11:00,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:00,409 INFO L93 Difference]: Finished difference Result 975 states and 6393 transitions. [2019-01-31 17:11:00,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:11:00,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:11:00,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:00,414 INFO L225 Difference]: With dead ends: 975 [2019-01-31 17:11:00,414 INFO L226 Difference]: Without dead ends: 973 [2019-01-31 17:11:00,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:11:00,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-01-31 17:11:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 930. [2019-01-31 17:11:00,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-01-31 17:11:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 6346 transitions. [2019-01-31 17:11:00,779 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 6346 transitions. Word has length 6 [2019-01-31 17:11:00,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:00,779 INFO L480 AbstractCegarLoop]: Abstraction has 930 states and 6346 transitions. [2019-01-31 17:11:00,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:11:00,779 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 6346 transitions. [2019-01-31 17:11:00,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:11:00,781 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:00,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:11:00,781 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:00,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:00,782 INFO L82 PathProgramCache]: Analyzing trace with hash 893370586, now seen corresponding path program 1 times [2019-01-31 17:11:00,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:00,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:00,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:00,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:00,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:00,895 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-31 17:11:00,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:00,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:00,896 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:11:00,896 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [30], [31] [2019-01-31 17:11:00,897 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:11:00,897 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:11:00,898 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:11:00,899 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-31 17:11:00,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:00,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:11:00,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:00,899 INFO 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-31 17:11:00,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:00,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:11:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:00,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:00,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-31 17:11:00,926 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-31 17:11:00,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:00,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:00,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:11:00,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:00,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:00,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:00,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, 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-31 17:11:00,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:00,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:00,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:00,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:00,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:11:00,987 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-31 17:11:00,988 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:01,016 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:01,037 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:01,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:01,066 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:01,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:01,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:11:01,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,119 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-31 17:11:01,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,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, 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-31 17:11:01,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,205 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-31 17:11:01,206 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:01,221 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:01,236 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:01,253 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:01,284 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-31 17:11:01,284 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-31 17:11:01,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,328 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-31 17:11:01,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:11:01,422 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-31 17:11:01,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-01-31 17:11:01,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 86 [2019-01-31 17:11:01,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:01,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:01,539 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:01,539 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-31 17:11:01,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:01,585 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-31 17:11:01,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:108, output treesize:84 [2019-01-31 17:11:01,673 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-31 17:11:01,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:01,691 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-31 17:11:01,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:01,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:11:01,710 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:01,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:11:01,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:11:01,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:11:01,710 INFO L87 Difference]: Start difference. First operand 930 states and 6346 transitions. Second operand 8 states. [2019-01-31 17:11:02,163 WARN L181 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-01-31 17:11:06,436 WARN L181 SmtUtils]: Spent 4.24 s on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-01-31 17:11:07,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:07,244 INFO L93 Difference]: Finished difference Result 985 states and 6551 transitions. [2019-01-31 17:11:07,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:11:07,245 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:11:07,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:07,249 INFO L225 Difference]: With dead ends: 985 [2019-01-31 17:11:07,249 INFO L226 Difference]: Without dead ends: 984 [2019-01-31 17:11:07,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:11:07,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-01-31 17:11:07,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 951. [2019-01-31 17:11:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-01-31 17:11:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 6492 transitions. [2019-01-31 17:11:07,653 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 6492 transitions. Word has length 6 [2019-01-31 17:11:07,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:07,653 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 6492 transitions. [2019-01-31 17:11:07,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:11:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 6492 transitions. [2019-01-31 17:11:07,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:11:07,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:07,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:11:07,656 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:07,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:07,656 INFO L82 PathProgramCache]: Analyzing trace with hash 908380782, now seen corresponding path program 1 times [2019-01-31 17:11:07,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:07,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:07,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:07,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:07,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:07,755 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-31 17:11:07,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:07,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:07,756 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:11:07,756 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [24], [27] [2019-01-31 17:11:07,757 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:11:07,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:11:07,759 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:11:07,759 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-31 17:11:07,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:07,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:11:07,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:07,760 INFO 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-31 17:11:07,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:07,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:11:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:07,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:07,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,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, 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-31 17:11:07,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,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 58 treesize of output 67 [2019-01-31 17:11:07,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,886 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-31 17:11:07,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:11:08,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,020 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-31 17:11:08,021 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:08,049 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:08,076 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:08,102 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:08,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:08,168 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-31 17:11:08,171 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-31 17:11:08,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:11:08,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, 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-31 17:11:08,180 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-31 17:11:08,183 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-31 17:11:08,183 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:08,219 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:08,240 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:08,256 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:08,270 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:08,282 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:08,328 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-31 17:11:08,329 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-31 17:11:08,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,375 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-31 17:11:08,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:08,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:11:08,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-31 17:11:08,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,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, 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-31 17:11:08,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:08,513 INFO L267 ElimStorePlain]: Start 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-31 17:11:08,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-31 17:11:08,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,559 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:08,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,561 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-31 17:11:08,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:08,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-31 17:11:08,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-31 17:11:08,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,654 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:08,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:08,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, 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-31 17:11:08,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:08,709 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-31 17:11:08,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-31 17:11:08,737 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:11:08,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:08,949 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-31 17:11:08,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:08,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:11:08,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:08,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:11:08,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:11:08,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:11:08,969 INFO L87 Difference]: Start difference. First operand 951 states and 6492 transitions. Second operand 12 states. [2019-01-31 17:11:21,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:21,296 INFO L93 Difference]: Finished difference Result 1024 states and 6701 transitions. [2019-01-31 17:11:21,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:11:21,296 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:11:21,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:21,301 INFO L225 Difference]: With dead ends: 1024 [2019-01-31 17:11:21,301 INFO L226 Difference]: Without dead ends: 1023 [2019-01-31 17:11:21,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-01-31 17:11:21,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-01-31 17:11:21,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 948. [2019-01-31 17:11:21,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-01-31 17:11:21,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 6467 transitions. [2019-01-31 17:11:21,685 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 6467 transitions. Word has length 6 [2019-01-31 17:11:21,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:21,685 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 6467 transitions. [2019-01-31 17:11:21,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:11:21,686 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 6467 transitions. [2019-01-31 17:11:21,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:11:21,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:21,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:11:21,687 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:21,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:21,688 INFO L82 PathProgramCache]: Analyzing trace with hash 908380906, now seen corresponding path program 1 times [2019-01-31 17:11:21,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:21,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:21,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:21,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:21,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:21,851 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-31 17:11:21,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:21,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:21,852 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:11:21,852 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [27] [2019-01-31 17:11:21,853 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:11:21,853 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:11:21,855 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:11:21,855 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-31 17:11:21,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:21,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:11:21,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:21,856 INFO 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-31 17:11:21,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:21,873 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:11:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:21,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:21,904 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-31 17:11:21,907 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-31 17:11:21,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:21,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:21,912 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-31 17:11:21,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:21,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:21,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11: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, 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-31 17:11:21,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:21,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:21,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:21,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:21,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:11:21,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:21,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:21,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:21,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:21,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:21,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:11:21,938 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:21,978 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:22,000 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:22,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:22,034 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:22,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:22,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,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 68 treesize of output 71 [2019-01-31 17:11:22,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:11:22,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,166 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-31 17:11:22,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,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, 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-31 17:11:22,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,331 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-31 17:11:22,331 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:22,358 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:22,383 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:22,409 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:22,434 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:22,479 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-31 17:11:22,480 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-31 17:11:22,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,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, 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-31 17:11:22,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:22,571 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-31 17:11:22,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-31 17:11:22,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,618 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-31 17:11:22,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:22,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:11:22,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-31 17:11:22,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,710 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:22,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,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, 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-31 17:11:22,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:22,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:11:22,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-31 17:11:22,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,805 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:22,806 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-31 17:11:22,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:22,858 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-31 17:11:22,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-01-31 17:11:22,883 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-31 17:11:22,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:22,937 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-31 17:11:22,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:22,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:11:22,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:22,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:11:22,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:11:22,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:11:22,957 INFO L87 Difference]: Start difference. First operand 948 states and 6467 transitions. Second operand 12 states. [2019-01-31 17:11:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:24,250 INFO L93 Difference]: Finished difference Result 1059 states and 6958 transitions. [2019-01-31 17:11:24,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:11:24,250 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:11:24,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:24,255 INFO L225 Difference]: With dead ends: 1059 [2019-01-31 17:11:24,255 INFO L226 Difference]: Without dead ends: 1057 [2019-01-31 17:11:24,255 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-31 17:11:24,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-01-31 17:11:24,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 945. [2019-01-31 17:11:24,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-01-31 17:11:24,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 6457 transitions. [2019-01-31 17:11:24,658 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 6457 transitions. Word has length 6 [2019-01-31 17:11:24,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:24,658 INFO L480 AbstractCegarLoop]: Abstraction has 945 states and 6457 transitions. [2019-01-31 17:11:24,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:11:24,658 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 6457 transitions. [2019-01-31 17:11:24,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:11:24,660 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:24,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:11:24,660 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:24,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:24,660 INFO L82 PathProgramCache]: Analyzing trace with hash 908367452, now seen corresponding path program 1 times [2019-01-31 17:11:24,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:24,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:24,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:24,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:24,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:24,739 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-31 17:11:24,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:24,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:24,739 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:11:24,739 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [27] [2019-01-31 17:11:24,740 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:11:24,740 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:11:24,741 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:11:24,741 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-31 17:11:24,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:24,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:11:24,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:24,742 INFO 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-31 17:11:24,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:24,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:11:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:24,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:24,777 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-31 17:11:24,780 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-31 17:11:24,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:24,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:24,784 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-31 17:11:24,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:24,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:24,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:24,791 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-31 17:11:24,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:24,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:24,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:24,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:24,800 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-31 17:11:24,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, 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-31 17:11:24,808 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:24,842 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:24,864 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:24,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:24,897 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:24,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:24,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:24,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:11:24,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:24,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:24,976 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-31 17:11:25,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,017 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-31 17:11:25,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,066 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-31 17:11:25,066 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:25,083 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:25,098 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:25,115 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:25,148 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-31 17:11:25,148 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-01-31 17:11:25,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:11:25,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:25,245 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-31 17:11:25,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-31 17:11:25,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,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, 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-31 17:11:25,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:25,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:11:25,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-01-31 17:11:25,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,348 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:25,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-31 17:11:25,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:25,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-31 17:11:25,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-31 17:11:25,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:25,418 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:25,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-01-31 17:11:25,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:25,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:11:25,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:11:25,476 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-31 17:11:25,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:25,535 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-31 17:11:25,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:25,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:11:25,554 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:25,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:11:25,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:11:25,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:11:25,554 INFO L87 Difference]: Start difference. First operand 945 states and 6457 transitions. Second operand 12 states. [2019-01-31 17:11:27,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:27,710 INFO L93 Difference]: Finished difference Result 1044 states and 6871 transitions. [2019-01-31 17:11:27,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:11:27,710 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:11:27,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:27,715 INFO L225 Difference]: With dead ends: 1044 [2019-01-31 17:11:27,715 INFO L226 Difference]: Without dead ends: 1042 [2019-01-31 17:11:27,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-01-31 17:11:27,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-01-31 17:11:28,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 982. [2019-01-31 17:11:28,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-01-31 17:11:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 6716 transitions. [2019-01-31 17:11:28,120 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 6716 transitions. Word has length 6 [2019-01-31 17:11:28,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:28,120 INFO L480 AbstractCegarLoop]: Abstraction has 982 states and 6716 transitions. [2019-01-31 17:11:28,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:11:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 6716 transitions. [2019-01-31 17:11:28,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:11:28,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:28,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:11:28,122 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:28,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:28,122 INFO L82 PathProgramCache]: Analyzing trace with hash 908371606, now seen corresponding path program 2 times [2019-01-31 17:11:28,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:28,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:28,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:28,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:28,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:28,234 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-31 17:11:28,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:28,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:28,235 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:11:28,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:11:28,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:28,235 INFO 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-31 17:11:28,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:11:28,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:11:28,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:11:28,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:11:28,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:28,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,277 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-31 17:11:28,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,318 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-31 17:11:28,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:11:28,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,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, 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-31 17:11:28,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,496 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-31 17:11:28,496 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:28,524 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:28,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:28,605 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:28,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:28,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:11:28,672 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-31 17:11:28,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, 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-31 17:11:28,678 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-31 17:11:28,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:11:28,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, 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-31 17:11:28,684 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:28,721 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:28,742 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:28,758 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:28,772 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:28,784 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:28,831 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-31 17:11:28,831 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-31 17:11:28,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,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, 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-31 17:11:28,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:28,921 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-31 17:11:28,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-31 17:11:28,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,967 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-31 17:11:28,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:29,012 INFO L267 ElimStorePlain]: Start 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-31 17:11:29,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-31 17:11:29,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,060 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:29,061 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-31 17:11:29,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:29,113 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-31 17:11:29,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-01-31 17:11:29,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,155 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:29,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:29,157 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-31 17:11:29,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:29,206 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-31 17:11:29,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-01-31 17:11:29,422 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-31 17:11:29,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:29,483 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-31 17:11:29,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:29,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:11:29,502 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:29,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:11:29,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:11:29,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:11:29,502 INFO L87 Difference]: Start difference. First operand 982 states and 6716 transitions. Second operand 12 states. [2019-01-31 17:11:30,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:30,803 INFO L93 Difference]: Finished difference Result 1044 states and 6839 transitions. [2019-01-31 17:11:30,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:11:30,803 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:11:30,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:30,808 INFO L225 Difference]: With dead ends: 1044 [2019-01-31 17:11:30,808 INFO L226 Difference]: Without dead ends: 1041 [2019-01-31 17:11:30,809 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-31 17:11:30,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-01-31 17:11:31,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 980. [2019-01-31 17:11:31,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-01-31 17:11:31,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 6702 transitions. [2019-01-31 17:11:31,232 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 6702 transitions. Word has length 6 [2019-01-31 17:11:31,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:31,232 INFO L480 AbstractCegarLoop]: Abstraction has 980 states and 6702 transitions. [2019-01-31 17:11:31,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:11:31,232 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 6702 transitions. [2019-01-31 17:11:31,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:11:31,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:31,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:11:31,234 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:31,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:31,234 INFO L82 PathProgramCache]: Analyzing trace with hash 908017958, now seen corresponding path program 1 times [2019-01-31 17:11:31,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:31,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:31,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:11:31,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:31,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:31,309 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-31 17:11:31,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:31,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:31,310 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:11:31,310 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [27] [2019-01-31 17:11:31,310 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:11:31,311 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:11:31,312 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:11:31,312 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-31 17:11:31,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:31,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:11:31,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:31,313 INFO 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-31 17:11:31,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:31,322 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:11:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:31,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:31,354 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-31 17:11:31,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:11:31,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:31,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:31,361 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-31 17:11:31,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:31,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:31,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:31,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:11:31,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:31,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:31,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:31,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:31,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:11: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, 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-31 17:11:31,387 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:31,416 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:31,439 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:31,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:31,473 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:31,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:31,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:31,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:11:31,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:31,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:31,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, 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-31 17:11:31,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:31,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:31,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:31,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:31,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:11:31,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:31,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:31,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:31,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:31,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:31,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:31,644 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-31 17:11:31,645 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:31,679 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:31,696 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:31,712 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:31,746 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-31 17:11:31,746 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-31 17:11:31,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:31,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, 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-31 17:11:31,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:11:31,966 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-31 17:11:31,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-01-31 17:11:32,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,097 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:32,106 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-31 17:11:32,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:11:32,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,263 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:32,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 60 treesize of output 80 [2019-01-31 17:11:32,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:32,352 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-31 17:11:32,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:135 [2019-01-31 17:11:32,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,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, 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-31 17:11:32,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:11:32,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 93 [2019-01-31 17:11:32,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:32,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-31 17:11:32,802 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:32,904 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-31 17:11:32,904 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:165, output treesize:147 [2019-01-31 17:11:33,036 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-31 17:11:33,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,056 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-31 17:11:33,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:33,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,230 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:33,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,248 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-31 17:11:33,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-01-31 17:11:33,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,539 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:33,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-31 17:11:33,541 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:33,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,704 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:33,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:11:33,705 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:33,844 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-31 17:11:33,845 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 21 variables, input treesize:190, output treesize:230 [2019-01-31 17:11:34,106 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 103 [2019-01-31 17:11:34,109 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-31 17:11:34,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:34,210 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-31 17:11:34,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:34,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:11:34,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:34,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:11:34,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:11:34,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:11:34,229 INFO L87 Difference]: Start difference. First operand 980 states and 6702 transitions. Second operand 12 states. [2019-01-31 17:11:34,412 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-31 17:11:34,684 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-31 17:11:35,096 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-01-31 17:11:35,544 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 75 [2019-01-31 17:11:36,225 WARN L181 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2019-01-31 17:11:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:37,145 INFO L93 Difference]: Finished difference Result 1104 states and 7131 transitions. [2019-01-31 17:11:37,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:11:37,146 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:11:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:37,150 INFO L225 Difference]: With dead ends: 1104 [2019-01-31 17:11:37,150 INFO L226 Difference]: Without dead ends: 1102 [2019-01-31 17:11:37,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-01-31 17:11:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2019-01-31 17:11:37,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 984. [2019-01-31 17:11:37,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-01-31 17:11:37,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 6730 transitions. [2019-01-31 17:11:37,563 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 6730 transitions. Word has length 6 [2019-01-31 17:11:37,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:37,563 INFO L480 AbstractCegarLoop]: Abstraction has 984 states and 6730 transitions. [2019-01-31 17:11:37,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:11:37,563 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 6730 transitions. [2019-01-31 17:11:37,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:11:37,565 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:37,565 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:11:37,565 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:37,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:37,565 INFO L82 PathProgramCache]: Analyzing trace with hash 908017524, now seen corresponding path program 1 times [2019-01-31 17:11:37,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:37,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:37,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:37,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:37,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:37,666 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-31 17:11:37,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:37,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:37,666 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:11:37,666 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [27] [2019-01-31 17:11:37,667 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:11:37,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:11:37,668 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:11:37,668 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-31 17:11:37,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:37,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:11:37,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:37,669 INFO 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-31 17:11:37,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:37,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:11:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:37,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:37,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:37,713 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-31 17:11:37,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:37,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:37,747 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-31 17:11:37,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:37,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:37,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:37,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:37,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, 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-31 17:11:37,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:37,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:37,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:37,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:37,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:37,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:37,841 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-31 17:11:37,842 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:37,867 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:37,889 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:37,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:37,945 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-31 17:11:37,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:11:37,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:11:37,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, 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-31 17:11:38,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:11:38,013 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-31 17:11:38,014 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:38,041 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:38,061 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:38,078 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:38,091 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:38,103 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:38,136 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-31 17:11:38,137 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-31 17:11:38,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:11:38,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:38,223 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-31 17:11:38,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:11:38,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,254 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:38,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-31 17:11:38,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:38,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:11:38,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:42 [2019-01-31 17:11:38,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-31 17:11:38,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:38,355 INFO L267 ElimStorePlain]: Start 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-31 17:11:38,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-31 17:11:38,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,387 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:38,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-31 17:11:38,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:38,422 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-31 17:11:38,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:34 [2019-01-31 17:11:38,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:11:38,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:38,493 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-31 17:11:38,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:38,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:11:38,511 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:38,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:11:38,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:11:38,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:11:38,512 INFO L87 Difference]: Start difference. First operand 984 states and 6730 transitions. Second operand 12 states. [2019-01-31 17:11:41,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:41,016 INFO L93 Difference]: Finished difference Result 1313 states and 8698 transitions. [2019-01-31 17:11:41,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:11:41,017 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:11:41,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:41,022 INFO L225 Difference]: With dead ends: 1313 [2019-01-31 17:11:41,023 INFO L226 Difference]: Without dead ends: 1312 [2019-01-31 17:11:41,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:11:41,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-01-31 17:11:41,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 839. [2019-01-31 17:11:41,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-01-31 17:11:41,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 5721 transitions. [2019-01-31 17:11:41,433 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 5721 transitions. Word has length 6 [2019-01-31 17:11:41,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:41,433 INFO L480 AbstractCegarLoop]: Abstraction has 839 states and 5721 transitions. [2019-01-31 17:11:41,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:11:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 5721 transitions. [2019-01-31 17:11:41,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:11:41,434 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:41,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:11:41,435 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:41,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:41,435 INFO L82 PathProgramCache]: Analyzing trace with hash 908550478, now seen corresponding path program 1 times [2019-01-31 17:11:41,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:41,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:41,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:41,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:41,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:41,491 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-31 17:11:41,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:41,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:41,492 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:11:41,492 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [24], [28], [29] [2019-01-31 17:11:41,493 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:11:41,493 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:11:41,494 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:11:41,494 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-31 17:11:41,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:41,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:11:41,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:41,495 INFO 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-31 17:11:41,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:41,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:11:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:41,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:41,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-31 17:11:41,592 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-31 17:11:41,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:11:41,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,738 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-31 17:11:41,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,746 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-31 17:11:41,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,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, 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-31 17:11:41,761 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:42,272 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:42,541 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:42,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:42,905 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:43,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:43,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-31 17:11:43,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-31 17:11:43,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-31 17:11:43,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:11:43,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,469 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-31 17:11:43,470 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:43,493 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:43,518 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:43,543 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:43,570 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:43,615 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-31 17:11:43,615 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-31 17:11:43,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,650 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-31 17:11:43,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:43,694 INFO L267 ElimStorePlain]: Start 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-31 17:11:43,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-31 17:11:43,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,734 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-31 17:11:43,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:43,781 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-31 17:11:43,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:51 [2019-01-31 17:11:43,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:43,875 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:43,876 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-31 17:11:43,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:43,925 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-31 17:11:43,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-01-31 17:11:43,948 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-31 17:11:43,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:43,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:11:44,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:44,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:11:44,008 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:44,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:11:44,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:11:44,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:11:44,008 INFO L87 Difference]: Start difference. First operand 839 states and 5721 transitions. Second operand 10 states. [2019-01-31 17:11:44,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:44,958 INFO L93 Difference]: Finished difference Result 881 states and 5780 transitions. [2019-01-31 17:11:44,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:11:44,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:11:44,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:44,961 INFO L225 Difference]: With dead ends: 881 [2019-01-31 17:11:44,961 INFO L226 Difference]: Without dead ends: 880 [2019-01-31 17:11:44,962 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-31 17:11:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-01-31 17:11:45,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 841. [2019-01-31 17:11:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-01-31 17:11:45,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 5735 transitions. [2019-01-31 17:11:45,392 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 5735 transitions. Word has length 6 [2019-01-31 17:11:45,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:45,392 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 5735 transitions. [2019-01-31 17:11:45,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:11:45,392 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 5735 transitions. [2019-01-31 17:11:45,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:11:45,393 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:45,393 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:11:45,394 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:45,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:45,394 INFO L82 PathProgramCache]: Analyzing trace with hash 908133404, now seen corresponding path program 1 times [2019-01-31 17:11:45,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:45,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:45,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:45,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:45,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:45,489 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-31 17:11:45,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:45,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:45,489 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:11:45,490 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [28], [29] [2019-01-31 17:11:45,490 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:11:45,490 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:11:45,492 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:11:45,492 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-31 17:11:45,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:45,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:11:45,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:45,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 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-31 17:11:45,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:45,502 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:11:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:45,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:45,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, 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-31 17:11:45,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, 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-31 17:11:45,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,525 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-31 17:11:45,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,533 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-31 17:11:45,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:11:45,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, 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-31 17:11:45,551 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:45,577 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:45,596 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:45,611 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:45,624 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:45,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:45,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:11:45,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,679 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-31 17:11:45,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,715 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-31 17:11:45,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,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, 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-31 17:11:45,763 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:45,775 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:45,790 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:45,806 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:45,837 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-31 17:11:45,838 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-31 17:11:45,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,881 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-31 17:11:45,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:45,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-31 17:11:45,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:11:45,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:45,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, 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-31 17:11:45,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:11:46,047 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-31 17:11:46,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-31 17:11:46,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:46,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:46,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:46,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:46,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:46,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:46,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:46,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:46,093 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:46,094 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-31 17:11:46,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:46,190 INFO L267 ElimStorePlain]: Start 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-31 17:11:46,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-01-31 17:11:46,206 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-31 17:11:46,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:46,231 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-31 17:11:46,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:46,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:11:46,250 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:46,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:11:46,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:11:46,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:11:46,250 INFO L87 Difference]: Start difference. First operand 841 states and 5735 transitions. Second operand 10 states. [2019-01-31 17:11:47,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:47,493 INFO L93 Difference]: Finished difference Result 1415 states and 9444 transitions. [2019-01-31 17:11:47,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:11:47,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:11:47,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:47,499 INFO L225 Difference]: With dead ends: 1415 [2019-01-31 17:11:47,499 INFO L226 Difference]: Without dead ends: 1413 [2019-01-31 17:11:47,500 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-31 17:11:47,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-01-31 17:11:48,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1280. [2019-01-31 17:11:48,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2019-01-31 17:11:48,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 8838 transitions. [2019-01-31 17:11:48,178 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 8838 transitions. Word has length 6 [2019-01-31 17:11:48,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:48,179 INFO L480 AbstractCegarLoop]: Abstraction has 1280 states and 8838 transitions. [2019-01-31 17:11:48,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:11:48,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 8838 transitions. [2019-01-31 17:11:48,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:11:48,181 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:48,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:11:48,181 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:48,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:48,181 INFO L82 PathProgramCache]: Analyzing trace with hash 909988134, now seen corresponding path program 1 times [2019-01-31 17:11:48,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:48,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:48,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:48,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:48,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:48,262 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-31 17:11:48,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:48,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:48,262 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:11:48,263 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [28], [29] [2019-01-31 17:11:48,263 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:11:48,264 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:11:48,265 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:11:48,265 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-31 17:11:48,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:48,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:11:48,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:48,265 INFO 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-31 17:11:48,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:48,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:11:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:48,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:48,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:11:48,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:48,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:48,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:11:48,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:48,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:48,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:48,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:48,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:11:48,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:48,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:48,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:48,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:48,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:48,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:48,390 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-31 17:11:48,390 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:48,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:48,422 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:48,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:48,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, 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-31 17:11:48,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, 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-31 17:11:48,471 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-31 17:11:48,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:11:48,480 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-31 17:11:48,489 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-31 17:11:48,490 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:48,515 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:48,534 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:48,549 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:48,561 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:48,573 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:48,604 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-31 17:11:48,604 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-31 17:11:48,800 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-31 17:11:48,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:48,858 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-31 17:11:48,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-01-31 17:11:49,263 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-31 17:11:49,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:349 [2019-01-31 17:11:49,416 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 75 [2019-01-31 17:11:49,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:49,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:49,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:49,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:49,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:49,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:49,429 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:49,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 99 [2019-01-31 17:11:49,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:11:49,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:49,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:49,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:49,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:49,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:49,627 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:49,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 2 case distinctions, treesize of input 58 treesize of output 93 [2019-01-31 17:11:49,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-31 17:11:49,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:49,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:49,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:49,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:49,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:49,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:49,822 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 61 [2019-01-31 17:11:49,823 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:49,932 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-31 17:11:49,933 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:162, output treesize:180 [2019-01-31 17:11:50,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:50,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:50,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:50,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:50,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:50,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:50,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 75 [2019-01-31 17:11:50,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:50,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:50,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:50,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:50,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:50,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:50,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:50,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:50,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 61 [2019-01-31 17:11:50,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:50,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:50,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:50,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:50,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:50,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:50,189 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:50,190 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 61 [2019-01-31 17:11:50,190 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:50,238 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-31 17:11:50,239 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:132, output treesize:92 [2019-01-31 17:11:50,309 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-31 17:11:50,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:50,356 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-31 17:11:50,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:50,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:11:50,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:50,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:11:50,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:11:50,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:11:50,376 INFO L87 Difference]: Start difference. First operand 1280 states and 8838 transitions. Second operand 10 states. [2019-01-31 17:11:50,744 WARN L181 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-31 17:12:22,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:12:22,329 INFO L93 Difference]: Finished difference Result 1381 states and 9127 transitions. [2019-01-31 17:12:22,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:12:22,330 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:12:22,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:12:22,334 INFO L225 Difference]: With dead ends: 1381 [2019-01-31 17:12:22,334 INFO L226 Difference]: Without dead ends: 1379 [2019-01-31 17:12:22,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:12:22,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2019-01-31 17:12:23,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1274. [2019-01-31 17:12:23,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-01-31 17:12:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-01-31 17:12:23,048 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-01-31 17:12:23,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:12:23,048 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-01-31 17:12:23,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:12:23,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-01-31 17:12:23,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:12:23,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:12:23,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:12:23,051 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:12:23,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:12:23,051 INFO L82 PathProgramCache]: Analyzing trace with hash 909993964, now seen corresponding path program 1 times [2019-01-31 17:12:23,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:12:23,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:12:23,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:12:23,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:12:23,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:12:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:12:23,100 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-31 17:12:23,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:12:23,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:12:23,101 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:12:23,101 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [28], [30], [31] [2019-01-31 17:12:23,102 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:12:23,102 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:12:23,104 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:12:23,104 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-31 17:12:23,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:12:23,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:12:23,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:12:23,105 INFO 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-31 17:12:23,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:12:23,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:12:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:12:23,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:12:23,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-31 17:12:23,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:12:23,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-31 17:12:23,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,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, 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-31 17:12:23,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,336 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-31 17:12:23,337 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:23,368 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:23,394 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:23,420 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:23,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:23,480 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-31 17:12:23,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, 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-31 17:12:23,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:12:23,513 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-31 17:12:23,517 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-31 17:12:23,520 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-31 17:12:23,521 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:23,556 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:23,575 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:23,588 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:23,600 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:23,613 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:12:23,656 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-31 17:12:23,657 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-31 17:12:23,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,683 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-31 17:12:23,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:12:23,728 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-31 17:12:23,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-31 17:12:23,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:12:23,760 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:12:23,769 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-31 17:12:23,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:12:23,919 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-31 17:12:23,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:110 [2019-01-31 17:12:33,388 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 74 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:12:33,390 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 45 more [2019-01-31 17:12:33,395 INFO L168 Benchmark]: Toolchain (without parser) took 328422.05 ms. Allocated memory was 135.3 MB in the beginning and 699.9 MB in the end (delta: 564.7 MB). Free memory was 110.5 MB in the beginning and 120.0 MB in the end (delta: -9.4 MB). Peak memory consumption was 555.2 MB. Max. memory is 7.1 GB. [2019-01-31 17:12:33,395 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 135.3 MB. Free memory is still 111.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 17:12:33,395 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.40 ms. Allocated memory is still 135.3 MB. Free memory was 110.3 MB in the beginning and 108.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-01-31 17:12:33,396 INFO L168 Benchmark]: Boogie Preprocessor took 25.25 ms. Allocated memory is still 135.3 MB. Free memory was 108.0 MB in the beginning and 106.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-31 17:12:33,396 INFO L168 Benchmark]: RCFGBuilder took 438.49 ms. Allocated memory is still 135.3 MB. Free memory was 106.8 MB in the beginning and 95.1 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. [2019-01-31 17:12:33,396 INFO L168 Benchmark]: TraceAbstraction took 327895.92 ms. Allocated memory was 135.3 MB in the beginning and 699.9 MB in the end (delta: 564.7 MB). Free memory was 94.9 MB in the beginning and 120.0 MB in the end (delta: -25.1 MB). Peak memory consumption was 539.6 MB. Max. memory is 7.1 GB. [2019-01-31 17:12:33,398 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 135.3 MB. Free memory is still 111.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.40 ms. Allocated memory is still 135.3 MB. Free memory was 110.3 MB in the beginning and 108.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.25 ms. Allocated memory is still 135.3 MB. Free memory was 108.0 MB in the beginning and 106.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 438.49 ms. Allocated memory is still 135.3 MB. Free memory was 106.8 MB in the beginning and 95.1 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 327895.92 ms. Allocated memory was 135.3 MB in the beginning and 699.9 MB in the end (delta: 564.7 MB). Free memory was 94.9 MB in the beginning and 120.0 MB in the end (delta: -25.1 MB). Peak memory consumption was 539.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...